"Abstract syntax tree" Rules (this is a strange terminology) can be interpreted as those rules that form the construction of abstract syntax in the process of parsing. They are usually written in the grammar rule for the nonterminal T as constructors over abstract syntax trees created by parsing auxiliary phrases T. If
T = '(' A ';' B ')' ;
is a grammar rule, the AST constructor for T may be
T(A,B)
involves building a T node with AST children constructed for subparameters A and B.
- , , . , ( "" ); , . , , ,
"declare s as function; ... s=7; ..."
- , (, "s - " - , declare, "s " ) , ().