Jump to content

Left recursion

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 155.98.68.51 (talk) at 22:45, 21 January 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The grammar

  E -> E + T
  E -> T

is a left-recurisve grammar