搜索资源列表
rs232_syscon_v
- This a state-machine driven rs232 serial port interface to a \"Wishbone\" // type of bus.-This a state-driven machine rs232 seria l port interface to a "Wishbone" / / type of bus.
MyREG
- 我的一个利用有限状态机的正则表达式的实现。-I use a finite state machine in the regular expression is achieved.
lc2
- this a pack include source code for quartus 2. It is an implementation of the LC2. The LC-2 computer is described in Introduction to Computing Systems from Bits & Gates to C & Beyond by Yale Patt and Sanjay Patel, McGraw Hill, 2001. The LC2 mode
有限自动机
- 有限自动机的运行，利用状态表和有限自动机的运行原理，识别一个输入串是否为一个有效的无符号定点实数。-of the operation, the use of tables and limited state of the automatic machine operation principle, to identify whether an input string as a symbol of effective non-sentinel real.
nfa_dfa
- 求正规表达式到NFA（不确定的有限自动机），NFA到DFA及DFA（有限自动机）的最小化 有注释。-seek formal expressions of the NFA (uncertain Finite Automata), the NFA to the DFA and DFA (finite state machine) is the smallest of the Notes.
刘琴-0206-44-自动机的应用
- 本课程设计采用C语言进行编译原理实现课题有限自动机的应用，其目的如下：(1) 理解有限自动机的作用；(2) 利用状态图和状态表表示有限自动机；(3) 以程序实现有限自动机的运行过程-courses designed using the C language compiler principles to achieve automatic machine issues limited the application of its purpose as follows : (a) limited u
fsm_vhdl
- very useful for the whom uses finite state machine and it is used for speech
DFA
- 简单DFA有穷自动机，可以根据输入的状态转换表，进行状态转换，对输入的字符串判断，该自动机是否可以接受。并有具体报告说明。-Simple DFA finite automata may be based on the input state transition table for state transitions, the input string to determine that the automatic machine is acceptable. And have specific
LexicalAnalyzer
- 手工构造一个能够识别C语言的所有典型单词，如：标识符、数字、运算符，和if、while等保留字的确定有限自动机，并写出对应该自动机的程序；然后以一个简化的C语言程序为输入文件，通过所设计的基于上述自动机的词法分析程序获得输入文件中的各个单词及其内码对照表，并以文件形式保存结果（也就是TOKEN序列）。 将自己定义的各个正则表达式转化为NFA，然后将其综合为NFA ，再将NFA 转化为DFA，再将DFA转化为最少状态的DFA ，最后由DFA 转化为词法分析程序。-Manually constr
Compilers
- 本人编写的一个采用递归下降法实现了PL0语言的编译器，程序分三部分：词法分析、语法分析、模拟执行器。运用有限状态自动机的方式实现，比传统的if-else方式更加简洁清晰。-Achieved by recursive descent PL0 language compiler, the program divided into three parts: lexical analysis, syntax analysis, simulation of the actuator. Finite sta
cifa-vcPP
- 一款编译原理中的词法分析器，利用有限状态机的机制，能够解析C语言代码的词法结构，将每一个句子变成一个一个单词的形式。-A lexical analyzer in the compiler theory, finite state machine mechanism, able to resolve the lexical structure of C language code, each a one-word sentence into a form.
DFA
- Compiler tech:Program For Acceptance Of A String Using deterministic finite automaton (DFA) which is a finite state machine accepting finite strings of symbols. For each state, there is a transition arrow leading out to a next state for each symbol.
DFA
- 编译原理文法输入，并根据输入的文法设计有穷状态自动机，判断是否未确定的，若否，则确定化！-Input grammar compiler theory and design of the input grammar finite state machine to determine whether the undetermined, and if not, determine the technology!