Path: utzoo!attcan!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!ucsd!ucbvax!CTC.CONTEL.COM!reid
From: reid@CTC.CONTEL.COM (Tom Reid x4505)
Newsgroups: comp.lang.modula2
Subject: Re:  Modula-2 grammar
Message-ID: <9012200045.AA05610@ctc.contel.com>
Date: 20 Dec 90 00:45:55 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: Modula2 List <INFO-M2%UCF1VM.BITNET@ucf1vm.cc.ucf.edu>
Organization: The Internet
Lines: 22

=  > 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
=

The *generated* parser.  The code generation module is not the most
efficient and the generated module runs at about 70K bytes.  FST
chokes on >64K under the excuse that nobody should ever write one
that big.  Another compiler writer who forgets about automatically
code generation.

Tom.