Re: First/Follow sets in Recursive Descent Parsers

"Dan Haxell" <Dan.Haxell@btinternet.com> wrote in message
> I am currently writing a utility to translate LaTeX math expressions
> into Maple syntax. So far I have been using Flex to generate the
> lexical analyser and then hand-coding a recursive descent parser (in
> C++).


Honestly, unless you're doing this to learn how to hand-code a parser,
I would use a parser generator. PCCTS is likely to be very suitable
for what you're doing, and it'll work out all the first/follow sets
for you. It's pretty well documented (which I've found to be a rarity
among freely available tools) and the error messages are pretty clear.
You can get it from www.polhode.com/pccts.html


HTH,


--
Mike Dimmick

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