Re: First/Follow sets in Recursive Descent Parsers

"Mike Dimmick" <mike@dimmick.demon.co.uk>
8 Aug 2001 01:08:36 -0400

          From comp.compilers

Related articles
First/Follow sets in Recursive Descent Parsers Dan.Haxell@btinternet.com (Dan Haxell) (2001-08-06)
Re: First/Follow sets in Recursive Descent Parsers ralph@inputplus.demon.co.uk (2001-08-08)
Re: First/Follow sets in Recursive Descent Parsers mike@dimmick.demon.co.uk (Mike Dimmick) (2001-08-08)
Re: First/Follow sets in Recursive Descent Parsers tmoog@polhode.com (Tom Moog) (2001-08-08)
Re: First/Follow sets in Recursive Descent Parsers therabbit@hole.com (2001-08-08)
| List of all articles for this month |

From: "Mike Dimmick" <mike@dimmick.demon.co.uk>
Newsgroups: comp.compilers
Date: 8 Aug 2001 01:08:36 -0400
Organization: Compilers Central
References: 01-08-029
Keywords: parse
Posted-Date: 08 Aug 2001 01:08:35 EDT

"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


Post a followup to this message

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