首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > 一种轻便高效的LALR(1)语法分析器生成方案

一种轻便高效的LALR(1)语法分析器生成方案

资 源 简 介

Description Lalr-scm is yet another LALR(1) parser generator written in Scheme. In contrast to other such parser generators, this one implements an efficient algorithm for computing the lookahead sets. The algorithm is the same as used in Bison (GNU yacc) and is described in the following paper: Efficient Computation of LALR(1) Look-Ahead Set, F. DeRemer and T. Pennello, TOPLAS, vol. 4, no. 4, october 1982. As a consequence, it is not written in a fully functional style. In fact, much of the code is a direct translation from C to Scheme of the Bison sources. Source Code Source code is hosted on Github. Some versions are also available from the Downloads section. Documentation New Features Portability

文 件 列 表

lalr-scm
glr-test.scm
gpl.txt
lalr.scm
lgpl.txt
README
tests
calc.scm

相 关 资 源

您 可 能 感 兴 趣 的

同 类 别 推 荐

VIP VIP
0.194105s