PEG Morphology Algorithm
On Sat, Dec 18, 2004 at 03:52:24PM -0800, Robin Lee Powell wrote:
> On Sat, Dec 18, 2004 at 08:13:24AM -0500, Pierre Abbat wrote:
> > On Saturday 18 December 2004 00:53, Robin Lee Powell wrote:
> > > If you want something that is definably unambiguous, but not
> > > PEG, that's negotiable, but the day that the Lojban community
> > > votes to define Lojban with a giant English algorithm
> > > description instead of something provably unambiguous is the
> > > day I find something else to do with my spare time.
> >
> > Is a C program sufficiently unambiguous?
>
> Absolutely not. It's not a formalism, it's a piece of code.
This is slightly innacurate: a C program written to *very* strictly
act like a PDA (push down automaton) or FSM (finite state machine)
would be acceptable, in that I could turn it in to a real formalism
easily.
-Robin