4 Jul
2005
4 Jul
'05
4:58 p.m.
On Thu, Jun 30, 2005 at 12:02:18AM -0700, Eric Niebler <eric@boost-consulting.com> wrote:
<< Background >> xpressive is a TR1 regex work-alike that also accepts regexes as expression templates and lets regexes nest and call each other recursively.
How does xpressive implement recursive/nested regexes? The nested regexes look like context-free grammars. Is expressive able to handle LL-1 grammars only, or even RL grammars? Regards Andreas Pokorny PS: I have not found enough time to implement some conveniece structures for spirit scanner generation based upon xpressive :(.