well I am building my compiler studio from scratch using some other techniques that I didn’t use last time when I developed compiler studio. I don’t have any prescribed scope right now and I am building it bit by bit right now. But still some of the major enhancements that I would like to be included in the new one are following:
regular expression parser able to parse expression directly into DFA(partially done)
combined dfa support
LR parser implementation
Abstract Syntax tree generation
Visualizers (Grammars, FA, other)
enhanced support in RE for other operator (other then *,+,|,?)
support for multiple language description format( BNF ,EBNF, custom)
Integration with other IDE, (eclipse and VS.net)
and this list goes on.
I have just started to work on the list, and it needs a bit of dedicated time, I was able to write a parser regular expression that parses the string into a Abstract Syntax Tree and calculates its firstpos, followpos, lastpos values for the node to construct a dfa. ( this is implemented as described in Compiler: Principles, Techniques and Tools by Aho, Sethi and Ulman). Now I am working on object model for FA/DFA/NFA and then RE conversion into FA.
download code from http://s.faraz.mahmood.googlepages.com/CompilerStudio20071010.zip