搜索资源列表
lexuretest
- 编译原理词法和语法分析,体内容是产生一个二元式文本文件,扩展名为dyd,可将Pascal程序(测试程序)分解成为一个一个的单词,并查“单词符号与种别对照表”得出其种别,用一数字表示,范围1-56(52-56分别对应保留字integer、real、boolean、char)。-compiler theory morphology and syntax analysis, body is a dual-generated text files, dyd the extension can be Pa
BufferPairs
- 编译原理(龙书)P3.1用C语言编写的图3-10中记号的词法分析器。-Compilation Principle (Liuzhou book) P3.1 using C language in Figure 3-10 marked lexical analyzer.
Lexical
- 简单的词法分析器 利用vc编程 功能 可以打开任意位置和名称的原文件进行词法分析,可以进行非法字符和数字后边跟字母的错误判断-The lexical analyzer easy to use programming function vc can open arbitrary location and name of the original document lexical analysis can be carried out illegal characters and letters
1-1
- 《现代编译原理C语言描述》书上第一章的直线式程序解释器的一个问题:写一个函数int maxargs(A_stm),告知给定语句中任意子表达式内的print语句的最大参数个数. 参照所给部分源码,在Linux环境下编写的,GCC版本4.4.4测试通过-The book Modern compiler Implementation In C, in first chapter of the book linear program interpreter there be a problem: W
LRfenxiqi
- 对于任意给定的输入串(词法记号流)进行语法分析,要求采用LR分析器来完成。手工构造LR分析表,利用移进-归约分析算法(P69 图3.12)输出(P70 表3.8)对应的动作部分。如: 输入:id*+id/(id+id)# 输出:移进 按 F->id归约 移进 error -For any given input string (the lexical token stream) parsing, required by LR parser to complet
dominators.tar
- 从图中生成支配树算法,即支配树生成算法,该算法常用于编译器。-From the dominant tree algorithm to generate the figure, the dominant tree generation algorithm, which is commonly used in the compiler.
C-Prepared-Lexical-Analyzer
- 词法分析器。建立分析器模型框架,根据分析器的状态转换图算法以及算法构造-Establish analyzer model framework, according to the analysis of the state transition figure algorithms structure
Lexical-analyzer
- 设计各个单词的状态装换图,并为不同的单词设计种别码。将词法分析器设计成供语法分析器调用的子程序。-Each word with the state of the design change figure, and for different words design codes will be kind lexical analyzer design into the parser calls for grammar subroutine
dfa
- dfa状态转换图的读取和根据图进行路径的判断。是编译原理的重要实验!-dfa state transition diagram of the read path and in accordance with Figure judgment . Important experimental compiler theory !