.png){kind=icon}
返回
Generalizing input-driven languages: Theoretical and practical benefits
.png){kind=icon}
OA
AI
DOI：10.1016/j.cosrev.2017.12.001.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Regular languages (RL) are the simplest family in Chomsky's hierarchy. Thanks to their simplicity they enjoy various nice algebraic and logic properties that have been successfully exploited in many application fields. Practically all of their related problems are decidable, so that they support automatic verification algorithms. Also, they can be recognized in real-time. Context-free languages (CFL) are another major family well-suited to formalize programming, natural, and many other classes of languages; their increased generative power w.r.t. RL, however, causes the loss of several closure properties and of the decidability of important problems; furthermore they need complex parsing algorithms. Thus, various subclasses thereof have been defined with different goals, spanning from efficient, deterministic parsing to closure properties, logic characterization and automatic verification techniques. Among CFL subclasses, so-called structured ones, i.e., those where the typical tree-structure is visible in the sentences, exhibit many of the algebraic and logic properties of RL, whereas deterministic CFL have been thoroughly exploited in compiler construction and other application fields. After surveying and comparing the main properties of those various language families, we go back to operator precedence languages (OPL), an old family through which R. Floyd pioneered deterministic parsing, and we show that they offer unexpected properties in two fields so far investigated in totally independent ways: they enable parsing parallelization in a more effective way than traditional sequential parsers, and exhibit the same algebraic and logic properties so far obtained only for less expressive language families. (C) 2017 Elsevier Inc. All rights reserved.
Keyword:
Regular languages
Context-free languages
Input-driven languages
Visibly pushdown languages
Operator-precedence languages
Monadic second order logic
Closure properties
Decidability and automatic verification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.7
论文数:
2.3K
被引数:
5.2K
机构
引用论文
.png){kind=icon}
Synthesis, Characterisation and Catalytic Application of Oxidorhenium Complexes Bearing H‐Spirophosphorane Ligands含h-螺膦配体的氧化铼配合物的合成，表征及催化应用
PREAI
分享收藏分享收藏Magnetic properties of CoFe1.9RE0.1O4 nanoparticles (RE=La, Ce, Nd, Sm, Eu, Gd, Tb, Ho) prepared in polyol在多元醇中制备的CoFe1.9RE0.1O4纳米颗粒 (RE = La，Ce，Nd，Sm，Eu，Gd，Tb，Ho) 的磁性能
PREAI
分享收藏
查看更多内容