zhixingheyi_tian的博客

lex词法分析器用于消除二义性的两条规则 There are two important disambiguation rules used by Lex and other similar lexical-analyzer generators: Longest match: The longest initial substring of the input that can matc...

syn-tax（语法） the way in which words are put together to form phrases, clauses, or sentences. 上下文无关文法 context-free grammars, a more powerful method of describing languages. Such grammars can ...

正则表达式和自动机具有等价性 EQUIVALENCE WITH FINITE AUTOMATA Regular expressions and finite automata are equivalent in their descriptive power. This fact is surprising because finite automata and regular expres...

递归下降分析法之预测分析法文法产生式举例一个预测分析器的伪代码void stmtO { } switch ( lookahead ) { case expr: match(expr); match(' ; ') ; break; case if: match(if); match(' C') ; match(expr); match(' ) ') ; stmtO; break; case for:

自动机理论 Automata theory deals with the definitions and properties of mathematical models of computation. These models play a role in several applied areas of computer science. One model, called the ...