|Parser generator that supports regular expressions? firstname.lastname@example.org (1992-06-12)|
|Re: Parser generator that supports regular expressions? N.Chapman@cs.ucl.ac.uk (Nigel Chapman) (1992-06-22)|
|Here is one. Re: Parser generator that supports regular expressions? email@example.com (1992-06-23)|
|Re: Parser generator that supports regular expressions? firstname.lastname@example.org (1992-06-29)|
|From:||email@example.com (Patrick Stickler)|
|Organization:||University of Helsinki, Finland|
|Date:||Fri, 12 Jun 1992 10:29:12 GMT|
Does anyone know of a YACC-like parse generator that allows regular
expressions in rules (i.e. iteration, optionality, disjunction, grouping,
etc.). I know that I can "emulate" these with left recursive rules, but
it's a bit of a pain and makes the definition very hard to debug/extend.
I plan to use lex for the lexical analyzer, so compatibility with lex or a
similar tool is important.
Any help would be greatly appreciated.
Patrick Stickler Research Unit for Computational Linguistics
firstname.lastname@example.org Department of General Linguistics
(+358 0) 4020366 University of Helsinki, Finland
Return to the
Search the comp.compilers archives again.