About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 90. Chapters: Abstract syntax, Affix grammar, Aliasing (computing), Array access analysis, Aspect weaver, Attribute grammar, Backus-Naur Form, Basic block, Binary recompiler, Bootstrapping (compilers), Call graph, Code generation (compiler), Compilers: Principles, Techniques, and Tools, Compiler correctness, Compiler Description Language, Compile time, Compile time function execution, Context-free grammar, Control flow graph, Control table, Data structure alignment, Dead code, Dominator (graph theory), Dynamic compilation, Dynamic recompilation, ECLR-attributed grammar, Extended Backus-Naur Form, Extended basic block, First-class function, Funarg problem, GNU cflow, Intermediate language, Intrinsic function, Just-in-time compilation, L-attributed grammar, Lexical analysis, Link time, Literal pool, Loop dependence analysis, Manifest expression, Man or boy test, Memory model (programming), Memory ordering, Metacompilation, Name mangling, Name resolution, Normalized loop, Object file, Overhead code, Parsing, Principles of Compiler Design, S-attributed grammar, Semantic dictionary encoding, Sethi-Ullman algorithm, Static build, Static single assignment form, String grammar, Symbol table, Syntax-directed translation, TBNF, Three address code, Thunk (object-oriented programming), Tombstone diagram, Trace scheduling, Trace tree, Tracing just-in-time compilation, Translation unit (programming), Van Wijngaarden grammar, Works Records System. Excerpt: Control tables are tables that control the control flow or play a major part in program control. There are no rigid rules about the structure or content of a control table-its qualifying attribute is its ability to direct control flow in some way through "execution" by a processor or interpreter. The design of such tables is sometimes referred to as table-driven design (although this...
