Each regular expression should be written in a subset of the perl regular expression syntax, or another suitable syntax. I have not committed to a specific subset yet.
The patterns are not allowed to contain recursive patterns, or interpolated expressions.
The input patterns should be processes into new patterns according to the following rules:
Each pattern will be wrapped in a capturing paranthesis pair. Nested paranthesises should be turned into non capturing paranthesises. The generated patterns should match ONLY at the front of the string matched - ie no matches at embedded newlines.
Thankful for any idea on how to implement this, which is intended for lexical analysis of embedded semantic actions in parser generator and other compiler construction tools.
"Home is not where you are born, but where your heart finds peace" - Tommy Nordgren, "The dying old crone"
-- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] <http://learn.perl.org/> <http://learn.perl.org/first-response>
