Subj : Re: Parser generators for a simple language form. How?
To   : comp.programming
From : Rob Thorpe
Date : Wed Aug 03 2005 02:11 am

ed_davis2 wrote:
> Rob Thorpe wrote:
> > You should be able to do what you need with a recursive descent parser.
> > Search the web for that phrase.  Also search the web for cfoogol - a
> > nice demonstration of the principle.
>
> Interesting example.  My favorite recursive descent parser example is
> from Wirth's Algorithms + Data Structures = Programs.  A version of
> his final example is here: http://www.246.dk/pl0.html
>
> > Also see my article on the subject:
> > http://realworldtech.com/page.cfm?ArticleID=RWT041902173146
>
> Nice article.  However, I read:
>
> "This is the second installment of a three part series on compiler
> technology and implementation."
>
> But I could not find the 3rd installment.  Do you have a URL?

To my shame I never finished the set.  The technology of back-end
compiler optimizations has advanced in recent years to beyond my
knowledge of the subject.

I might finish it if I get the time to learn more about the subject.

.