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 ]