摘要
本文根据LL(1)文法的特点,运用等价替换的思想,结合两种代入法,提出了改写非LL(1)的4条规则,由这4条规则构成的改写方法的能力优于目前其它方法。
This paper presents a method of great capability of rewritingnon-LL(1) grammars into LL(1) ones, which consists of four rules: Rule 1: left factoring (existing) Rule 2: simple substitution Rule 3: restoring substitution Rule 4: equivalent transformation on the basis of historical information
出处
《湘潭大学自然科学学报》
CAS
CSCD
1991年第2期166-170,共5页
Natural Science Journal of Xiangtan University
关键词
编译程序
改写
LL(1)文法
compilers
programming languages
automatic compiling
software
