上下文无关文法的可视化描述

Visualized description of context-free grammar

上下文无关文法借助有限规则集和递归手段实现语言生成问题的刻画.这一形式系统多以符号串集形式呈现,并因递归技术的应用而渐变复杂,晦涩难懂.文章探讨其可视分析问题,涉及文法到有限状态变迁系统的构造、理论证明和应用方法.这项工作不仅有助形式系统各要素间的关系的直观刻画,而且为结构化推导分析、语义重用奠定基础.

Context-free grammar is a formal framework delineating language generating in light of a finite set of rules and recursions. It appears in string forms and is employed on the basis of recursions, therefore becoming complex and difficult to understand. In this paper, we will elaborate on the visualized counterpart of the formal system, discussing transformation of grammar into finite state transition system, theoretical proofs and applications. This work not only contributes much to intuitive grasp of relationships between various factors of the con- cerned grammar, but also lays the foundation for structured derivation analysis and semantic reuse.