0

If there is a grammar:

A -> AA | e

where e is epsilon (the empty string) is there any way to eliminate left recursion from this grammar?

icktoofay
  • 126,289
  • 21
  • 250
  • 231

1 Answers1

1

if this is all of the grammar then of course you can:

A -> e

if not please provide more of your homework ;)

Random Dev
  • 51,810
  • 9
  • 92
  • 119