RE: Grammar for parsing regular expression

I find it difficult to believe this is impossible, but then I don't know ActionScript. Still, the fact that ActionScript exists as a language suggests it is possible to parse it.

I'm going to guess that the answer is to use lexical states.  That's how the same characters can have different meanings in different situations.

---

Date: Wed, 15 Apr 2009 14:04:05 +0200
From: klangner@...
To: users@...
Subject: [JavaCC] Grammar for parsing regular expression

Hello,

I'm working on grammar for ActionScript language. I learned a lot from java grammar include with javacc examples.
Now I want to parse regular expression. My first idea was to create token similar to string token, but it looks that it isn't possible to decide was is regex and what is math expression on the token level.

Since there are regular expression in java I was looking for examples in java 1.5 grammar.
No luck.

Since I don't want to reinvent wheel :-), anyone knows where I can find grammar for javacc with regular expression parsing?

Thank you in advance
Krzysztof

---

Get news, entertainment and everything you care about at Live.com. Check it out!