You are here: irt.org | FOLDOC | structural recursion
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)
Nearby terms: strong typing « Stroustrup, Bjarne « struct « structural recursion » structured analysis » Structured Analysis and Design Technique » structured design
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL