Rafsi =3D 4Rafsi | 3Rafsi TerminalRafsi =3D CCV | CVV | CVCCV | CCVCV 4Rafsi =3D CVCCy | CCVCy 3Rafsi =3D CVV | CCV | CVVr | CVVn | CVC | CVCy Must the parsing of the unknown lujvo begin from the right? or left? or i= s it unambiguous regardless? Given a 4Rafsi of the form CVCCy or CCVCy, I'= m assuming that there's only one gismu with those first 4 letters -- right?= =20=20 Any other suggestions for how to do the parsing? Thanks. ------=_NextPart_000_002A_01C0A8DD.A8898F00 Content-Type: text/html; charset="Windows-1252" Content-Transfer-Encoding: quoted-printable

I'm working on an algorithm for breakin= g a=20 lujvo into its component parts. (My goal: given an unknown lujvo, bre= ak it=20 up into parts and display the definitions of each of those parts.) Ch= apter=20 4, section 11 of the grammar book ("The lujvo-making algorithm") talks abou= t=20 creating lujvo, but my question is about the reverse. Is there a plac= e=20 where this is simply described?

If there's not, let me try this: I've t= ried to=20 compose a grammar that defines a lujvo. Could someone critique=20 it?

lujvo =3D InitialRafsi = ;=20 TermainlRafsi

InitialRafsi =3D Rafsi = ;=20 InitialRafsi | <null>

Rafsi =3D 4Rafsi |&nb= sp;=20 3Rafsi

TerminalRafsi =3D CCV | CVV= | CVCCV=20 | CCVCV

4Rafsi =3D CVCCy |=20 CCVCy

Must the parsing of the unknown lujvo b= egin=20 from the right? or left? or is it unambiguous regardless? = =20 Given a 4Rafsi of the form CVCCy or CCVCy, I'm assuming that there's only o= ne=20 gismu with those first 4 letters -- right?

Any other suggestions for how to do the= =20 parsing?

Thanks.

------=_NextPart_000_002A_01C0A8DD.A8898F00--