Context free grammar extended by constrained formula and an improved LR parser are adopted to formalize and recognize the special strings.
提出从组成形式和上下文语境两个方面来自动识别汉语文本中的各种特殊符号串。
They are a simple but powerful generalization of regular expressions that are easier to work with than the LALR or LR-1 grammars of traditional parser generators.
它们是简单但功能强大的泛化正则表达式，比起传统的LALR或者LR-1语法的解析器生成器来说更易于使用。
They are a simple but powerful generalization of regular expressions that are easier to work with than the LALR or LR-1 grammars of traditional parser generators.
它们是简单但功能强大的泛化正则表达式，比起传统的LALR或者LR-1语法的解析器生成器来说更易于使用。
应用推荐