Table driven LL.

Christopher F Clark <christopher.f.clark@compiler-resources.com>
Sun, 22 May 2022 12:24:01 +0300

          From comp.compilers
Related articles
Table driven LL. christopher.f.clark@compiler-resources.com (Christopher F Clark) (2022-05-22)
| List of all articles for this month |
From: Christopher F Clark <christopher.f.clark@compiler-resources.com>
Newsgroups: comp.compilers
Date: Sun, 22 May 2022 12:24:01 +0300
Organization: Compilers Central
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

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

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.