[英]Removing Left recursion in CFG's
How would I go about removing left recursion from this line from a grammar? 我将如何从语法的这一行中删除左递归?
A -> D | A-> D | R |
R | r BA n ;
BA |
| AA |
AA | epsilon
ε
r, n and ; r,n和; are terminal symbols.
是终端符号。 D,R,B and A are all non-terminals.
D,R,B和A均为非末端。
Thanks in advance 提前致谢
You can find your answer in wikipedia . 您可以在Wikipedia中找到答案。
Also, this is a possible duplicate of removing left recursion in a context free grammar . 同样,这是在上下文无关文法中删除左递归的可能重复。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.