Re: Parsing newbie -- recursion question (probably simple)

63q2o4i02@sneakemail.com
15 Nov 2005 23:27:31 -0500

          From comp.compilers
Related articles
Parsing newbie -- recursion question (probably simple) sonicsmooth@gmail.com (2005-11-12)
Re: Parsing newbie -- recursion question (probably simple) wyrmwif@tsoft.org (SM Ryan) (2005-11-13)
Re: Parsing newbie -- recursion question (probably simple) DrDiettrich@compuserve.de (Hans-Peter Diettrich) (2005-11-13)
Re: Parsing newbie -- recursion question (probably simple) desw@sussex.ac.uk (Des Watson) (2005-11-13)
Re: Parsing newbie -- recursion question (probably simple) 63q2o4i02@sneakemail.com (2005-11-15)
Re: Parsing newbie -- recursion question (probably simple) cfc@shell01.TheWorld.com (Chris F Clark) (2005-11-15)
Re: Parsing newbie -- recursion question (probably simple) nicola.musatti@gmail.com (Nicola Musatti) (2005-11-15)
| List of all articles for this month |
From: 63q2o4i02@sneakemail.com
Newsgroups: comp.compilers
Date: 15 Nov 2005 23:27:31 -0500
Organization: http://groups.google.com
References: 05-11-05905-11-079
Keywords: parse, summary
Posted-Date: 15 Nov 2005 23:27:31 EST

Hi,


Thanks for everyone's input on this. I rewrote the grammar with 2
rules for each left recursive rule, so


A -> A a | b


becomes


A -> b A'
A'-> a A' | null


(yes copied from the textbook I found on my shelf)


I've started to implement simple things like expressions and stuff in
python. So far it's coming along. I'll try this, then EBNF to see if
it maps more easily to code.


thanks again for everyone's help
Michael

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.