WTFM ! Alex
2011/4/11 Terence Parr <pa...@cs.usfca.edu> > I considered this post a "we've achieved cold fusion" announcement, but I'm > always open if there's something credible to read. > Ter > On Apr 11, 2011, at 12:31 PM, Peter Goodman wrote: > > > Agreed. I am interested in seeing your results; a webpage, a link to a > > document describing your method, or a follow-up PEG post would be > > appreciated. > > > > Best Regards, > > > > Peter Goodman, > > On Mon, Apr 11, 2011 at 3:25 PM, Robin Lee Powell > > <rlpow...@digitalkingdom.org> wrote: > >> People in the theoretical CS field tend to only be interested in > >> ideas that are fully written up and clearly explained publically > >> somewhere; if you've got something that works, you should turn it > >> into a web page or a blog post or something. > >> > >> -Robin > >> > >> On Mon, Apr 11, 2011 at 01:14:52AM -0700, Yury Euceda wrote: > >>> 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 > PEG@lists.csail.mit.edu > https://lists.csail.mit.edu/mailman/listinfo/peg >
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
