An LR Parser with Less States

摘要：

　　This paper presents a new construction method of LR parser which is based on the theory of deterministic finite automata.The deterministic infinite automata are simplified for obtaining the LR parsing table with fewer states by merging the equivalent states.The new construction method has the same reorganization power as LALR parser but avoids the reduce/reduce conflict in LALR method.The experiment results show that the number of states in parsing table can be reduced greatly if the proposed method is used.

关键词： grammar parser grammar parsing table deterministic finite automata

作者: TANG Hong-jun

作者单位: Information Engineering Institute.HangZhou Dianzi University, HangZhou, China

会议类型: 国际会议

会议名称: 2012 International Conference on Engineering Materials,Geotechnical Engineering and Environmental Engineering(EMGEEE2012)(2012工程材料、岩石工程和环境工程国际会议)

会议地点: 石家庄

会议语种:英文

页码: 684-687

在线出版日期: 2012-10-26（万方平台首次上网日期，不代表论文的发表时间）