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)

N="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 ]