Re: languages

From: "jason_box" <cppisfun@xxxxxxxxx>
Date: 13 Feb 2006 09:32:10 -0800

I think I see what is going on. After looking at your post and revising
the grammar here is what I got:

S->aBa
B-> aa | C | lambda
C-> b | C | lambda

I think this is correct but the problem is the a's always have to be
equal and I think maybe the transition for B might not be 100%.

.

Follow-Ups:
- Re: languages
  - From: beelzebub

References:
- languages
  - From: jason_box
- Re: languages
  - From: Barb Knox
- Re: languages
  - From: jason_box
- Re: languages
  - From: Barb Knox

Prev by Date: Re: Ambuguity of CFG
Next by Date: Re: Ambuguity of CFG
Previous by thread: Re: languages
Next by thread: Re: languages
Index(es):
- Date
- Thread

Relevant Pages

Grammar classification
... So far I know that if an LLgrammar has any lambda productions it's ... I prefer to have a clue how to ... Prev by Date: ...
(comp.compilers)
Re: Favorite non-python language trick?
... >> from functional import map, filter, reduce ... > but lambda is grammar, so probably not so easy to import? ... of Python, so it is possible. ...
(comp.lang.python)