资源列表
cifafenxiqi
- 编译原理实验报告，词法分析器（C++版），简单实现都本程序则是通过对给定路径的文件的分析后以单词符号和文字提示显示-Lab report compiler theory, lexical analyzer (C++ version), a simple procedure to achieve all of this is given by the path of the file analysis in order to display the word symbol and text pro
yufafenxichengxu
- 语法编译器的功能与实现，采用的是递归下降发，新手多多指教。-Grammar compiler features and implementation, using recursive descent hair, novice exhibitions.
C51
- 1、对于PIC16C54，U51完全能够 正确反编译。 2、对于PIC16C57，由于 PIC16C57有2K ROM，分4 PAGES ，当有跨页跳转或跨页调用时可 能不能够正确反编译。所以对程 序作改动时要相当注意，改动之 前需对这些指令进行调整。
NFA
- 编译原理实验 NFA识别语言的java实现，为NFA.java文件中的NFA类实现成员函数boolean recognizeString(int move[][][], int accept_state[], String word).-Principle experiment NFA compile the java language to achieve recognition for NFA.java file NFA class implements member functions b
jflex-examples
- 编译原理实验例程 一个统计hello单词数的程序,只需编写Count.flex，运行说明请看readme.txt-Compile a statistical routines principle experiment the number of hello word program, just write Count.flex, then the following command to get the results jflex Count.flex javac Count.java java
fengmingqi
- 蜂鸣器是基于在ADS编译器中编写的，通过捕获来控制开发板上的蜂鸣器，实现通过代码控制-You have not played the first half-year-old was released GMAM dual N-recognition access is not your department SDBD JS white bar
bianyi
- 编译技术的课件，对编译技术的学习有很重要的指导作用和启发意义。-Compiler technology courseware, learning techniques for compiling a very important role in guiding and enlightening.
cifafenxi
- 1、根据要求写出词法分析的正规文法G；2、根据正规文法G，写出正则式RE；3、根据正则式RE，画出NFA；4、将NFA转化为DFA；5、将DFA转化为mininum state DFA；6、mininum state DFA就是词法分析程序的流程图，根据此流程图编写相应的词法分析程序。-1, according to the lexical analysis required to write a formal grammar G 2, according to a regular gramm
lexForShell
- 简单的shell解释器的实现，实现了管道，重定向功能，可以执行少数的内部指令，可以后台运行，注释清晰。-Simple shell interpreter to achieve, to achieve the pipes, redirection, you can perform a small number of internal commands can run in the background, clear notes.
youqiuzhuangtai
- 正则文法拆分，识别有穷状态自动机是确定的还是非确定的，判断是否为正则文法。 -Regular grammars and finite state automata, regular grammars split, identification of finite state automata is determined or non-determined. Enter the master regular grammar.
wenfa
- 文法的拆分，存储，输入输出及终结符号与非终结符号的判定-Grammar of the split, storage, input and output, and end with the nonterminal symbols to determine
CString
- C-String Tokenizer for C++. Breaks up words into small pieces and stores in an array for word validation