The parser generating system PGS
The parser generating system PGS
复制标题
解析器生成系统 PGS
DOI：
--
复制
发表时间：
1989
期刊：
影响因子：
--
通讯作者：
M. Martin
中科院分区：
文献类型：
--
作者：
E. Klein;M. Martin
PG是一种在扩展的BNF符号中接受LALR（1）和相关语法的解析器，并基于表驱动的堆栈自动机产生解析器机构允许在规则之间转移，生成的解析器具有自动误差恢复，以满足PGS的特定需求例如，PG生成的解析器是YACC1的两倍，而解析表需要少25％的存储空间。详细说明，它比较了几个分析表的表示及其对生成的解析器的空间和时间效率的影响。
PGS is a parser generating system accepting LALR(1) and related grammars in extended BNF notation and producing parsers based on table‐driven stack automata. To enable syntax‐directed translation, semantic actions can be attached to rules of the input grammar. An attribution mechanism allows the transfer of information between rules. The generated parsers have an automatic error recovery which can be tailored to satisfy specific needs of the language to be accepted. PGS generates parsers written in Pascal, Modula‐2, C or Ada. Compared with existing systems, e.g. YACC1, a parser generated by PGS is twice as fast and the parse tables require 25 per cent less storage. This paper gives a survey of algorithms involved in the generator and the generated parsers, and compares them with algorithms used in other systems. In detail, it compares several parse‐table representations and their implications for space and time efficiency of the generated parsers.