Yury, Those parse trees are what I expected. I'm now excited to see your algorithm. I implemented a parser that appeared to parse all forms of recursion; however, it was complicated and its running time was polynomial in the length of the input. I look forward to seeing what you've come up with!
Best Regards, Peter Goodman, http://www.petergoodman.me 70 Winston Circle, Montreal, Quebec H9S 4X6 On Tue, Apr 12, 2011 at 1:50 AM, Yury Euceda <yuryeuc...@yahoo.com> wrote: > Ok, I made that tests and these are the results. > > ________________________________ > From: Peter Goodman <peter.good...@gmail.com> > To: Yury Euceda <yuryeuc...@yahoo.com> > Cc: peg@lists.csail.mit.edu; Robin Lee Powell <rlpow...@digitalkingdom.org> > Sent: Mon, April 11, 2011 9:56:24 PM > Subject: Re: [PEG] Hello, please read > > Yury, > > Can you post any pictures of parse trees generated with the following > grammar and the following strings? > > Grammar: > S -> S S T > / S c > / a > / b > > T -> d > > Strings: > aad > abcd > aaadcd > bcabcdd > abcdabcdd > abcdabcddabcdd > > I am curious to see the behavior of your parsing method in the > presence of more complex left recursion and what behaviors your parser > exhibits when expanding out left recursion within a non-left recursive > invocation of a left recursive production. > > Best Regards, > > Peter Goodman, > http://www.petergoodman.me > 70 Winston Circle, > Montreal, Quebec > H9S 4X6 > > > > On Mon, Apr 11, 2011 at 11:35 PM, Yury Euceda <yuryeuc...@yahoo.com> wrote: >> I'm sending you some pics generated with my tool at the moment of >> recognizing left recursive rules. >> These are all tests ... and it's working great!!! the rules used are: >> >> polinomyRecursive : polinomyRecursive ("+"|"-") monomy | monomy >> monomy : real ("*" identifier ("^" unsignedInteger)?)? >> identifier : ("_"*|"$"?) letter ("_"|letter|digit)* >> real : ("+"|"-")? digit+ ("." digit*)? >> unsignedInteger : digit+ >> letter : "A".."Z" | "a".."z" >> digit : "0".."9" >> >> and for math expressions: >> expression : expression ("+"|"-") factor | factor >> factor : factor ("*"|"/") power | power >> power : atom "^" power | atom >> atom : "(" expression ")" | integer | identifier >> >> And there are many things of your interest that I'm going to cover in a >> paper soon ... cheers >> >> ________________________________ >> From: Peter Goodman <peter.good...@gmail.com> >> To: Yury Euceda <yuryeuc...@yahoo.com>; peg@lists.csail.mit.edu >> Cc: Robin Lee Powell <rlpow...@digitalkingdom.org> >> Sent: Mon, April 11, 2011 1:31:02 PM >> Subject: Re: [PEG] Hello, please read >> >> 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, >> http://www.petergoodman.me >> 70 Winston Circle, >> Montreal, Quebec >> H9S 4X6 >> >> >> >> 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 >>> >>> >>> -- >>> http://singinst.org/ : Our last, best hope for a fantastic future. >>> Lojban (http://www.lojban.org/): The language in which "this parrot >>> is dead" is "ti poi spitaki cu morsi", but "this sentence is false" >>> is "na nei". My personal page: http://www.digitalkingdom.org/rlp/ >>> >>> _______________________________________________ >>> 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
