|Re: error recovery email@example.com (1989-04-30)|
|Error recovery firstname.lastname@example.org (Cayot Robert-Olivier) (1997-03-21)|
|Re: Error recovery email@example.com (Gord Cormack) (1997-03-22)|
|Re: Error recovery P.Whillance@ncl.ac.uk (Peter Whillance) (1997-03-27)|
|Error Recovery firstname.lastname@example.org (1997-05-12)|
|Re: Error Recovery email@example.com (1997-05-25)|
|Re: Error Recovery firstname.lastname@example.org (Thomas W. Christopher) (1997-05-25)|
|[2 later articles]|
|From:||email@example.com (Hank Dietz)|
|Summary:||a lexical an. gen. & LL(1) parser gen. soon to be PD|
|Keywords:||DFA, LL(1), recursive descent, attributed grammar|
|Date:||30 Apr 89 16:46:33 GMT|
An MS student of mine named Terence Parr has been building a really spiffy
lexical analyzer generator and LL(1) parser generator program for his MS
thesis. It accepts a yacc+lex-like input syntax, but generates BOTH parser
and lexer from a single unified description. Beyond that, it accepts the
usual EBNF extensions for 0-or-more, alternative, and optional subrules and
supports dynamically-allocated/deallocated attributes (e.g., by default, all
$ variables are variable-length strings).
The lexers generated are DFAs very similar to those built by lex, but with a
more direct implementation (bigger but faster). The parsers are recursive
descent C code, but use switches and mapping tables where appropriate, rather
than the usual binary comparisons, to find the next alternative to apply and
to give rather decent error messages (based on first sets). In non-trivial
test cases, the recognizers it builds have run consistently upwards of 25K
lines per second....
We will be putting this stuff in PD within the next few months. If anyone
is interested in testing "alpha" versions of the package, send me email.
PS: Some of you may recall me mentioning a lexer generator a while back...
well, that's part of this package.
Return to the
Search the comp.compilers archives again.