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 ------------------------------------------------------------------------------
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)