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)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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 ]