The process of transforming an expression by expressing its structure as a syntax tree and applying a certain transformation rule to each kind of node, starting from the top. Rules for non-leaf nodes will normally return a result which depends on applying the rules recursively to its sub-nodes. Examples include syntax analysis, {code generation}, {abstract interpretation} and {program transformation}. (1995-01-11)

In addition suitable contents:
[ = ] [ abstract interpretation ] [ af ] [ ai ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ bs ] [ by ] [ ch ] [ cl ] [ co ] [ code ] [ cu ] [ de ] [ du ] [ E ] [ ec ] [ ee ] [ er ] [ era ] [ es ] [ et ] [ expression ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ ge ] [ gen ] [ generation ] [ gr ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ inc ] [ include ] [ int ] [ io ] [ is ] [ it ] [ ki ] [ leaf ] [ Lex ] [ lt ] [ lu ] [ ly ] [ ma ] [ mall ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ne ] [ ng ] [ no ] [ node ] [ norm ] [ ns ] [ om ] [ op ] [ pe ] [ ph ] [ pl ] [ ply ] [ pr ] [ process ] [ program ] [ program transformation ] [ query ] [ rc ] [ re ] [ recursive ] [ ro ] [ ru ] [ se ] [ si ] [ st ] [ struct ] [ su ] [ sy ] [ syntax ] [ syntax tree ] [ T ] [ tar ] [ th ] [ to ] [ tr ] [ transformation ] [ tree ] [ ve ]