|Re: Recursive-descent C parser WANTED firstname.lastname@example.org (1992-02-27)|
|Re: Recursive-descent C parser WANTED email@example.com (1992-02-27)|
|Re: Recursive-descent C parser WANTED firstname.lastname@example.org (1992-02-27)|
|Re: Recursive-descent C parser WANTED email@example.com (1992-03-04)|
|From:||firstname.lastname@example.org (Willem Jan Withagen)|
|Date:||Wed, 4 Mar 1992 17:02:24 GMT|
In article <1342@dms.UUCP> albaugh@dms.UUCP (Mike Albaugh) writes:
> Anyway, while such programs [Yacc/Lex/Bison/Flex] are "cool", they
>leave much to be desired in the area of error recovery, just the area
>where it is pretty simple to get a naive recursive descent parser to help
[About error recovery in these programs]
I don't want to sound like a commercial, but the GMD-tools have a
lalr translator which is able to generate some error recovery without
Me, just being rather lazy, thought it ought to be enough. And yes it can
guess the missing ';' from my pascal-tests and 'repair' the syntax.
Now this is only for the one syntax I'm currently working on, maybe
other syntaxes aren't this easy.
Ciao, Wilem Jan
And here's the plug for:
on compinfo.eb.ele.tue.nl you can now ask all questions you'd ever want
to ask about your precious pet. (No money back guarantee, but then I don't
charge :-) )
NEW There's also a server for comp.compilers.
NEW it contains over a year's worth of articles.
Just call (from a vt100) :
'telnet compinfo.eb.ele.tue.nl 3403'
and follow the instructions.
Got any complaints, remarks, ... just put them in my mailbox
Eindhoven University of Technology DomainName: email@example.com
Digital Systems Group, Room EH 10.10
P.O. 513 Tel: +31-40-473401
5600 MB Eindhoven The Netherlands
Return to the
Search the comp.compilers archives again.