A Programming Methodology in Compiler Construction: Concepts
North-Holland Publishing Company : New York : sole distributors for the USA and Canada, Elsevier North-Holland, 1979 - Computers - 308 pages
Introduction. Regular syntaxes. Definitions on regular syntaxes and expressions. Finite-state acceptors. The finite-state (FS) acceptor. The 1-predictive finite-state (1-FS) acceptor. The 1-predictive finite-state (1-FS) acceptor program. Generation of finite-state acceptors. The generation scheme for 1-FS acceptors. The definitions of follow and dirsymb. The generation scheme for 1-FS acceptor programs. Regular translation syntaxes. Examples of regular translation syntaxes. The generalized regular translation syntax. Finite-state transducers. The 1-predictive finite-state (1-FS) transducer. The 1-predictive finite-state transducer program. The generalized 1-predictive finite-state transducer program. Generation of finite-state transducers. Extended contex-free syntaxes. Definitions on extended context-free syntaxes and expressions. Symple examples of extended context-free syntaxes. Relation between context-free and extended context-free syntax. Alternative definitions. Pushdown acceptors. Generation of pushdown acceptors. Extended context-free translation syntaxes. Pushdown transducers. Generation of pushdown transducers. Attributed syntaxes. Attributed pushdown transducers and their generation. Appendix 1. Appendix 2. References.
What people are saying - Write a review
We haven't found any reviews in the usual places.
representation of real numbers where 5
15 other sections not shown
Other editions - View all
1-FS acceptor program 1-FS transducer program acceptor halts access oh access_result AECF aeVinu APD list arithmetic expressions binary relation calculated called char configuration defined deletestack denoted derivation tree deterministic DIRSYMB DIRSYMB(e2 eĢie ECF expression ECF subexpression ECF syntax ECF translation expression ECF translation syntax ELL(l EMPTY(e end marker EXAMPLE EXTENDED CONTEXT-FREE finite control finite set finite-state FIRST(e floating point inherited attributes input head input string integer itate iymboli iynth Katholieke Universiteit Leuven language leftmost symbol lexical lexical analysis metalanguage mode node nonterminal symbols normalized ECF output symbols output tape PICO-ALGOL proc accept proc read pushdown list pushdown transducer qe,e,skip qe,skip read elie error relation semantic functions sentential form set operator syntax F syntax rule synthesized attributes terminal symbols terminal translation form tion tranilation transition function transitive closure type_result variable Vatt void Vout workp workp_after workp_before