Related articles |
---|
Parser generator that supports regular expressions? stickler@utrio.helsinki.fi (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? ipser@solomon.technet.sg (1992-06-23) |
Re: Parser generator that supports regular expressions? compres!bz@primerd.prime.com (1992-06-29) |
Newsgroups: | comp.compilers |
From: | stickler@utrio.helsinki.fi (Patrick Stickler) |
Keywords: | yacc, question |
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.
Thanks,
--
Patrick Stickler Research Unit for Computational Linguistics
stickler@cc.helsinki.fi Department of General Linguistics
(+358 0) 4020366 University of Helsinki, Finland
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.