一种上下文无关语言语法树的存储模式及其应用  

Storage Mapping of Syntax Tree for Context-Free Language and its Application

作　　者：敖丽敏[1] 冯潮阳[2] 

机构地区：[1]中国农业大学信息与电气工程学院,北京100083 [2]东北电力学院信息工程系,吉林吉林132012

出　　处：《小型微型计算机系统》2005年第12期2245-2249,共5页Journal of Chinese Computer Systems

摘　　要：针对上下文无关语言的句子所对应的语法树G树的表示形式提出了一种关系数据库的存储形式.这种存储形式的优点是:表示形式一致;句子分析简单;语句执行速度快.这种存储形式作为一种上下文无关语言的中间语言的形式可以直接交付解释器(抽象机)执行.同时介绍基于这种表示形式的上下文无关句子的编辑器.编辑器是基于W eb的交互式语法制导生成方式实现的.这种表示与存储形式被用于一种描述过程性知识的函数式语言.A storage mapping of G tree of syntax tree in relational databases is represented. The syntax tree is an intermediate representation for sentence of context-free language. The storage mapping has several advantages, such as the formal of representation is consistency, the sentence constructed is simple and the sentence in the formal of syntax tree is interpreted quickly. The intermediate representation of sentence as context-free language in the storage mapping is sent to abstract-machine, the interpreter （abstract machine） can interpret without processing. A language editor for sentence of context-free language in the storage mapping based on interactive syntax directed and web is designed and implemented. The representation and storage mapping are used in functional language system with describing procedural knowledge.

关 键 词：上下文无关语言 语法树 表示形式 语法制导 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]