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 6
16 other sections not shown
Other editions - View all
1-FS acceptor program 1-FS transducer program 1-predictive acceAi acceptor halts access oi access_result APD list arithmetic expressions binary relation calculated called char configuration defined deletestack denoted derivation tree deterministic DIRSYMB ECF expression ECF subexpression ECF syntax ECF translation expression ECF translation syntax eJUe error ELL(l EMPTY(e end marker EXAMPLE EXTENDED CONTEXT-FREE finite control finite set finite-state FIRST(e floating point iatie inherited attributes input head input string input symbols integer itate Katholieke Universiteit Leuven language leftmost symbol lexical lexical analysis metalanguage mode node nonterminal symbols normalized ECF oi F output symbols PICO-ALGOL proc pushdown list pushdown transducer qe,e,skip qe,skip read etie error relation scale oi semantic functions sentential form set operator syntax F syntax rule synthesized attributes tAanilation terminal symbols terminal translation form tion transition function transitive closure value oi variable Vatt void Vout workp workp_after