The syntax transformer will go through each rule and try to find a matching pattern.
这种语法转换器会遍历每条规则，并试图查找一个匹配的模式。
Lex tries each rule in order, matching the longest stream of input it can.
lex依次尝试每一个规则，尽可能地匹配最长的输入流。
Select the Matching rule TAB to define the actual rule.
选择Matching Rule选项卡，以定义实际的规则。
This approach is implemented by rule set building, tree pattern matching and math expression transformation.
该方法通过建立数学规则库，对两个数学表达式进行树型模式匹配和算式变换来实现。
This approach is implemented by rule set building, tree pattern matching and math expression transformation.
该方法通过建立数学规则库，对两个数学表达式进行树型模式匹配和算式变换来实现。
应用推荐