C编译器源码是我到处找来的,看了之后很有收获

pascal的编译器 交作业没问题 -perpendicular operation of the compiler no problem Haha

本程序的功能是：将中缀表达式（只能含有的运算符为( ) / * + - =）转化为后缀表达式，-this procedure is the function : China will decorate the expression (containing only the operator ()/*- =) into suffix expression,

学习编译原理 第六章- Studies the translation principle sixth chapter

伯克利的语法分析器的创建工具 -Creator for Berkeleys syntactic analysis

简易C语言词法分析程序.zip直接解压即可解压后内有说明，请参考说明-simple C language lexical analysis procedure. Zip can be directly extracted unpacked within a note, please refer to Note

Standar Snake Using Pascal

这是我们老师留的作业，还算不错我给完成了，希望给想做的朋友一点启发

用C开发的C语言编译器，实现了词义、语义、语法检查和分析-C development of the C language compiler and realized the meaning, semantics, syntax check and analysis

计算所汉语词法分析系统ICTCLAS.分词正确率高达97.58%(973专家组评测)，未登录词识别召回率均高于90%，其中中国人名的识别召回率接近98%处理速度为31.5Kbytes/s。ICTCLAS的特色还在于：可以根据需要输出多个高概率结果，有多种输出格式，支持北大词性标注集，973专家组给出的词性标注集合。-Calculate the Chinese Lexical Analysis System ICTCLAS. Segmentation correct rate of 97.58 percent (973 Expert Group on Evaluation), the recall rate of identification of unknown words were higher than 90 percent, of which China s name to identify the recall rate of nearly 98 percent processing speed for 31.5Kbytes/s. Also features ICTCLAS is: can output a number of high probability that there are a variety of output formats, to support the North-of-speech tagging sets, 973 expert group is given a collection of-speech tagging.

解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original grammar, after equal in value grammar establishment grammar tree which eliminates the left recursion, after but the grammar tree carries on the root to spread the calendar regarding this, after then obtains decorates the type