Another possibility is to compile the syntax tree into machine code and execute it.

Some of the distinctions presented above are represented in syntax trees.

Abstract syntax trees are also used in program analysis and program transformation systems.

They would all converge to an abstract syntax tree in a unique format that a compiler can handle.

The latter results in an abstract syntax tree being given to the function.

Computer scientists often need to manipulate abstract syntax trees.

These are recognizers that process abstract syntax trees which can be automatically generated by parsers.

Their role is to transform syntax trees according to a number of user-defined rules.

For example, given an expression x+y*z+u, the corresponding syntax tree would be:

A programmer can write expressions that produce Haskell code in the form of an abstract syntax tree.