Lex and yacc can be used to parse fairly simple and regular grammars.
lex和yacc可以用来解析相当简单和规则的语法。
This paper gives an effective method for deciding whether any two regular grammars are equivalent.
本文将给出判定任意两个正则文法是否等价的一种有效方法。
The concepts of (deterministic) lattice-valued regular grammars(DLRG and LRG, respectively) and (deterministic) lattice-valued regular languages are formulated.
给出了(确定)格值正则文法与(确定)格值正则语言的定义。
应用推荐