Hello everybody!!!
This is my first time I subscribe in a mailing list and I need some help about
how to use it...
But the good news I have for you is that I developed a powerful algorithm
capable of solve left recursion, right recursion and both (skiping the
ambiguity
problem letting the right recursion to command when both are in the same rule
definition)
I developed and IDE for testing purposes (well it's not finished yet, but it's
nearly close) in actionscript 3. I'm sure that all people studying PEGs and
Compiler Theory are going to get surprised of my advances ...
some of the benefits of my algorithm is:
You're going to be able to develop a computer language (compiler) capable of
sintax and semantic morphing (like Katahdin .. see Chris Seaton's paper)
It can handle very easy with left recursion, right recursion and both at the
same time (with linear algorithms for this!!!)
You can get the benefit of ambiguity in some situations if necesary
In general al the compilation process maybe planned to be done in one step!!!
(lexical-sintactical-semantic in one step and maybe code generation or code
interpretation)
Very easy to implement semantic analisys ... a lot of advantages
I think my tool it's goning to be another paradigm in compiler research.
If you're interested please send me an email
cheers
_______________________________________________
PEG mailing list
[email protected]
https://lists.csail.mit.edu/mailman/listinfo/peg
