Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!wuarchive!mit-eddie!uw-beaver!milton!ogicse!zephyr.ens.tek.com!tektronix!nosun!qiclab!m2xenix!puddle!p15.f20.n226.z1.fidonet.org!Jon.Guthrie
From: Jon.Guthrie@p15.f20.n226.z1.fidonet.org (Jon Guthrie)
Newsgroups: comp.lang.modula2
Subject: Re:  Modula-2 grammar
Message-ID: <76.276DCDAB@puddle.fidonet.org>
Date: 16 Dec 90 18:00:44 GMT
Sender: ufgate@puddle.fidonet.org (newsout1.26)
Organization: FidoNet node 1:226/20.15 - cmhGate UF Gateway, Columbus OH
Lines: 14


 > Incidently, the recursive descent parser created from the EBNF breaks the
 > FST compiler because it exceeds 64K characters.  

That's odd.  The recursive-descent parser I wrote works just fine when  
compiled with FST.  (At least it properly parses itself.) 

I guess my first question would be: WHAT exceeds 64K characters?  The parser  
itself?  The symbol table?  The stack space?  The input file?


--  
uucp: uunet!m2xenix!puddle!226!20.15!Jon.Guthrie
Internet: Jon.Guthrie@p15.f20.n226.z1.fidonet.org