首页 | 本学科首页   官方微博 | 高级检索  
     

一种上下文无关语言语法树的存储模式及其应用
引用本文:敖丽敏,冯潮阳.一种上下文无关语言语法树的存储模式及其应用[J].小型微型计算机系统,2005,26(12):2245-2249.
作者姓名:敖丽敏  冯潮阳
作者单位:1. 中国农业大学,信息与电气工程学院,北京,100083;东北电力学院,信息工程系,吉林,吉林,132012
2. 东北电力学院,信息工程系,吉林,吉林,132012
摘    要:针对上下文无关语言的句子所对应的语法树G树的表示形式提出了一种关系数据库的存储形式.这种存储形式的优点是:表示形式一致;句子分析简单;语句执行速度快.这种存储形式作为一种上下文无关语言的中间语言的形式可以直接交付解释器(抽象机)执行.同时介绍基于这种表示形式的上下文无关句子的编辑器.编辑器是基于Web的交互式语法制导生成方式实现的.这种表示与存储形式被用于一种描述过程性知识的函数式语言.

关 键 词:上下文无关语言  语法树  表示形式  语法制导
文章编号:1000-1220(2005)12-2245-05
收稿时间:2004-10-15
修稿时间:2004-10-15

Storage Mapping of Syntax Tree for Context-Free Language and its Application
AO Li-min,FENG Zhao-yang.Storage Mapping of Syntax Tree for Context-Free Language and its Application[J].Mini-micro Systems,2005,26(12):2245-2249.
Authors:AO Li-min  FENG Zhao-yang
Affiliation:1.College of Information and Electrical Engineering, China Agricultural University, Beijing 100083, China; 2. Department of Information Engineering, Northeast China Institute of Electric Power Engineering, Jilin 132012, China
Abstract: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.
Keywords:context-free language  syntax tree  represent  syntax-directed
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号