WikiDiscuss

WikiDiscuss


PEG Morphology Algorithm

On Saturday 18 December 2004 08:45, Jorge "Llambías" wrote:
> --- Pierre Abbat wrote:
> > The problem I see with implementing this in PEG is that valfendi bites
> > off a piece by counting syllables after the stress, then checks whether,
> > among other things, the hyphens are in the right place. Is there a way to
> > check one
> >
> > PE against the part of a string that matched another PE?
>
> Yes, with "&" and "!".
>
> exp <- &exp1 exp2
>
> will succeed only if exp2 starts with or is the start of exp1
>
> exp <- !exp1 exp2
>
> will succeed only if exp2 doesn't start with nor is the start of exp1

But how do you check that exp1 and exp2 are identical?

phma
--
..i toljundi do .ibabo mi'afra tu'a do
..ibabo damba do .ibabo do jinga
..icu'u la ma'atman.