Left recursion elimination in an LL1 grammar

孤街醉人 提交于 2019-12-06 16:06:20

Start with

expression ::= fragment ( ( + | - | * | / )  fragment )*
fragment ::= identifier | number | ( + | - ) fragment | expression

Define

frag1 ::= identifier | number | ( + | - ) fragment

Note that fragment is equivalent to frag1 | expression. Replace the former by the latter everywhere to get

expression ::= (frag1 | expression) ( ( + | - | * | / )  (frag1 | expression) )*
frag1 ::= identifier | number | ( + | - ) (frag1 | expression)

fragment is no longer needed.

Distribute to get

expression ::= frag1 more | expression more   ,

where

more ::= ( ( + | - | * | / )  (frag1 | expression) )*

Now you can see that an expression is a frag1 followed by one or more more

So

expression ::= frag1 (more)+

Your grammar is still ambiguous -- there are 2 parse tress for "1 * - 2 * 3". But at least it is not left recursive anymore.

(If you use this in your assignment, be sure to cite this answer, so you don't end up breaking your institution's academic dishonesty rules.)

I still think your instructor made a mistake, since, if you change

fragment ::= identifier | number | ( + | - ) fragment | expression

to

fragment ::= identifier | number | ( + | - ) fragment | "(" expression ")"   ,

you have a sensible grammar for expressions.

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!