Description: 语法分析器lex和词法分析器yacc的C++语言实现
1.Lex
（1）Lex输入文件的解析
（2）正规表达式的解析
（3）一个正规表达式到NFA的转换算法实现
（4）多个NFA的合并
（5）NFA的确定化和最小化算法实现
（6）返回状态与返回内容的对应
2.Yacc
（1）Yacc输入文件的解析
（2）上下文无关文法到对应LR(1)文法的下推自动机的构造
（3）LR(1)文法的下推自动机到相应分析表的构造
（4）LR(1)总控程序的构造（查表程序）
（5）符号表的构建与相应管理程序
（6）语义动作程序的加入
环境:Visual Studio.NET 2003-Parser lex and yacc lexical analyzer C language 1.Lex (1) Lex lose into the analytical document (2) Analysis of the formal expression (3) a formal expression of the NFA conversion algorithm (4 ) more than the combined NFA (5) NFA and the determination of the smallest algorithm (6) to return to state and the return of the contents 2.Yacc counterparts (1) Yacc the analytical input file (2) context-free grammar to the corresponding LR (1) grammar pushdown automata Construction (3) LR (1) grammar pushdown automata corresponding to the tectonic analysis table (4) L R (1) General procedures for the control structure (look-up table) (5) Construction of the symbol table with the corresponding management procedures (6) semantic action procedures to the environment : Visual Studio 2003 Platform: |
Size: 41490 |
Author:尤冉 |
Hits:
Description: 语法分析器lex和词法分析器yacc的C++语言实现
1.Lex
（1）Lex输入文件的解析
（2）正规表达式的解析
（3）一个正规表达式到NFA的转换算法实现
（4）多个NFA的合并
（5）NFA的确定化和最小化算法实现
（6）返回状态与返回内容的对应
2.Yacc
（1）Yacc输入文件的解析
（2）上下文无关文法到对应LR(1)文法的下推自动机的构造
（3）LR(1)文法的下推自动机到相应分析表的构造
（4）LR(1)总控程序的构造（查表程序）
（5）符号表的构建与相应管理程序
（6）语义动作程序的加入
环境:Visual Studio.NET 2003-Parser lex and yacc lexical analyzer C language 1.Lex (1) Lex lose into the analytical document (2) Analysis of the formal expression (3) a formal expression of the NFA conversion algorithm (4 ) more than the combined NFA (5) NFA and the determination of the smallest algorithm (6) to return to state and the return of the contents 2.Yacc counterparts (1) Yacc the analytical input file (2) context-free grammar to the corresponding LR (1) grammar pushdown automata Construction (3) LR (1) grammar pushdown automata corresponding to the tectonic analysis table (4) L R (1) General procedures for the control structure (look-up table) (5) Construction of the symbol table with the corresponding management procedures (6) semantic action procedures to the environment : Visual Studio 2003 Platform: |
Size: 40960 |
Author:尤冉 |
Hits:
Description: 一个简单的语法分析器实现，采用的是自顶向下的算法，结构清晰，容易理解，适合初学者学习。-Parser A simple realization is based on top-down algorithm, the structure of clear and easy to understand for beginners to learn. Platform: |
Size: 265216 |
Author:罗兴 |
Hits:
Description: 一份完整的编译原理课程设计.设计了一个词法分析器和一个利用LL(1)算法实现的语法分析器.可以对C-语言编写的程序进行词法分析和语法分析,当出现错误时推断可能的原因.并最终用直观的方式构建起一棵语法分析树.-A complete compilation Principle. Designed a lexical analyzer and a use of LL (1) parser algorithm. Can be written in C-language program for lexical analysis and syntax analysis, may be inferred when an error occurs reasons. and eventually built up with an intuitive way to parse tree. Platform: |
Size: 269312 |
Author:无意乂 |
Hits:
Description: （1） 根据LL(1)分析法编写一个语法分析程序，可根据自己实际情况，选择以下一项作为分析算法的输入：
a. 直接输入根据已知文法构造的分析表M
b.输入文法的FIRST(α)和FOLLOW(U)集合，由程序自动生成文法的分析表M；
c.输入已知文法，由程序自动构造文法的分析表M。
（2） 程序具有通用性
所开发的程序可适用于不同的文法和任意输入串，且能判断该文法是否为LL(1)文法。
（3） 有运行实例
对于输入的文法和符号串，所编制的语法分析程序应能正确判断此串是否为文法的句子，并要求输出分析过程。
-(1) According to the LL (1) method to write a parser, according to their own situation, choose one of the following analysis of the algorithm as input:
a. directly into the basis of known structures of grammar table M
b. enter the grammar of FIRST (α) and FOLLOW (U) set automatically by the program analysis table statute of Health M
c. Enter known grammar, the program can automatically construct grammatical analysis table M.
(2) program has universal
The developed program used in various types of grammar and an arbitrary input string, and can determine whether the grammar LL (1) grammar.
(3) the running instance
Grammar and symbols for the input string, the parser should be compiled correctly determine whether this string of sentence grammar, and asked the output of the process. Platform: |
Size: 289792 |
Author:zmf |
Hits:
Search - algorithm for C parser