词法语法分析，说明说明原理的词法分析和语法分析的全过程！...

简单的语法分析,递归下降语法分析-simple syntax analysis, recursive grammar analysis drop

这是一个JAVA代码反编译程序，对需要反编译的人来说是一个值得学习的程序！-This is a JAVA code decompile procedures need to decompile the people is a learning process!

Small compiler for Pascal

一个flex和bison用法入门的很好的例子。　按照词法分析,语法分析,语义分析的顺序来熟悉flex和bison这两个有力的工具。最后给出了一个用flex做词法分析用bison做语法分析设计的科学计算器（不同于一般程序设计中的入门级计算器），是学习编译原理的很好的例子。-a flex and bison portal usage of a very good example. According lexical analysis, parsing, Semantic analysis of the sequence to flex and bison familiar with these two powerful tool. Finally, a use flex do lexical analysis bison do syntax analysis and design of scientific calculators (unlike General Program Design"s entry-level calculators), compiler theory is the study of good examples.

自己写的一个simple语言scanner，也许有些错。可作参考。-a scanner of simple language writed by myself,maybe it has error.you can consult.

我写的词法语法分析器- I write morphology grammar analyzer

词法分析器：源程序的运行方式： 运行程序 输入一个已存在的文本文档的文件名。如：input.txt 如果要对整个程序进行语法分析，则按‘y’键，否则按‘n’键 如果要对程序进行语法分析，则按‘y’键，否则按‘n’键 程序结束-lexical analyzer : the source of the mode of operation : the importation of operational procedures already exist in a text file in the file name. Such as : input.txt if the entire procedure syntax analysis, the provision "y" button, or by the "n" key to the procedure syntax analysis, the provision "y" button, or by the "n" key end of the program

lalr1编译器，网上找的，可以使用！是学习编译原理这门课程的好例子，大家下下来可以自己试一试-lalr1 compiler, for the Internet, you can use! Principle study compiled this course a good example, where you can down their test!

Full support for extended regular expressions (those with intersection and complement); Support for some kinds of cycles in grammar; DFA-based operation; Unicode support; C++ only, requires a modern compiler; Lexical analyzers can be configured to get symbols from any input class (built-in support for std::istream, std::wistream and FILE *); Designed to work with Whale, but can work standalone or interface to other parsers.-Full support for extended regular expressions (those with intersection and complement); Support for some kinds of cycles in grammar; DFA-based operation; Unicode support; C only, requires a modern compiler; Lexical analyzers can be configured to get symbols from any input class (built-in support for std::istream, std::wistream and FILE*); Designed to work with Whale, but can work standalone or interface to other parsers.

简单的LL（1）的分析，具体可见程序，有过程，一目了然，谢谢指教-simple LL (1) analysis, we can see specific procedure, a process, clear, thank you enlighten