Path: csiph.com!weretis.net!feeder6.news.weretis.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Christopher F Clark Newsgroups: comp.compilers Subject: Table driven LL. Date: Sun, 22 May 2022 12:24:01 +0300 Organization: Compilers Central Lines: 22 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <22-05-044@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="48845"; mail-complaints-to="abuse@iecc.com" Keywords: parse, LL(1) Posted-Date: 22 May 2022 13:01:44 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:3017 George Neuner speculated that table driven LL parsing is possible, and I will answer yes. When I was in college taking my compilers course (circa 1976) our teacher (Dr Burton J Smith who later ran Cray) had us implement a table driven LL parser (as well as a recursive descent one, and an LR one so that we would see the different techniques and how they applied--we also did a regular expression state machine as the first homework). One can also uses FAs to implement the rule selection process of LL (and do your rules as regular epxressions/FAs also). There are many combinations that work. Kind regards, Chris -- ****************************************************************************** Chris Clark email: christopher.f.clark@compiler-resources.com Compiler Resources, Inc. Web Site: http://world.std.com/~compres 23 Bailey Rd voice: (508) 435-5016 Berlin, MA 01503 USA twitter: @intel_chris ------------------------------------------------------------------------------