Your Death to Dot Star post is rather convincing!
I like merlyn's comment concerning inching along though. If I really had to write something to parse foo { ... }; I'd probably use that.
What I find really intriguing however is the original question posed however vague. Given a Perl'ish structure of text where you have a symbol followed by a open curly brace followed by more text with possibly more curly braces (open and closed) how do you go about matching the right pair?
My first instinct would be to look towards some sort of recursive parser and not a regex. What are your thoughts?
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Peter L. Berghold --- Peter@Berghold.Net
"Those who fail to learn from history are condemned to repeat it."
|