Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | 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). Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)53 54 52 55 43 54 55 52 41 4C 52 45 43 55 52 53 49 4F 4E |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010011 01010100 01010010 01010101 01000011 01010100 01010101 01010010 01000001 01001100 00100000 01010010 01000101 01000011 01010101 01010010 01010011 01001001 01001111 01001110 |
HTML Code (1990) (references)S T R U C T U R A L   R E C U R S I O N |
ISO 10646 (1991-1993) (references)0053 0054 0052 0055 0043 0054 0055 0052 0041 004C 0052 0045 0043 0055 0052 0053 0049 004F 004E |
Encryption (beginner's substitution cypher): (references)535452553754555235462523937555253434948 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
