0

Got a simple grammar that have to transform to LL(1) i've tried many solutions but removed the left recursion but it does not produce the same grammar.

The grammar is this:

X -> E $
E -> E E o
E -> n

Any idea how can i turn this right recursive? Is there any general algorithm?

Favolas
  • 6,963
  • 29
  • 75
  • 127
  • 1
    possible duplicate of [Removing left recursion](http://stackoverflow.com/questions/2652060/removing-left-recursion) – rici Jun 11 '14 at 14:50
  • If the indicated duplicate isn't good enough, there are dozens of other similar questions. Or look at the Wikipedia article. – rici Jun 11 '14 at 14:50

0 Answers0