Context-Free Grammars with Lookahead
Context-Free Grammars with Lookahead
复制标题
具有前瞻功能的上下文无关语法
DOI：
10.1007/978-3-030-68195-1_16
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Takayuki Miyazaki and Yasuhiko Minamide
中科院分区：
文献类型：
--
作者：
高橋和也;南出靖彦;Takayuki Miyazaki and Yasuhiko Minamide
我们介绍了上下文无关文法与前瞻。该文法是上下文无关文法和解析表达式文法的扩展，因此可以统一处理这两种文法。为了适应lookahead，我们使用一种带有lookahead的语言，它是一组字符串对。我们把文法看作是一个方程组，并通过从空集开始的迭代次数的限制，给出了具有前瞻性的语言。这个语言类在并、交、补、弱连接和Kleene星星下是封闭的。
We introduce context-free grammars with lookahead. The grammars are an extension of both context-free grammars and parsing expression grammars, hence we can handle the two grammars in a unified way. To accommodate lookahead, we use a language with lookahead, which is a set of string pairs. We considered the grammar as a system of equations and give the language with lookahead by the limit of iterations from the empty set. The language class is closed under union, intersection, complement, and a weak version of concatenation and Kleene star.