Publication:4057550

Publication date: 1971

68-02: Research exposition (monographs, survey articles) pertaining to computer science

68N01: General topics in the theory of software

Related Items

Evaluating Boolean function with random variables, A syntax directed macro processor, Reverse polish notation method, On evaluating boolean expressions, Correctness proofs of syntax-directed processing descriptions by attributes, On the 'correct prefix property' in precedence parsers, Erratum to ``On the 'correct prefix property' in precedence parsers, On parsing two-level grammars, Methods and means of parallel processing of information, A parsing automata approach to LR theory, Automatic correction of syntax-errors in programming languages, A conversational language for solving problems in dimensional analysis, Retrieval from context trees, Attributed translations, LL-regular grammars, A note on precedence functions, A note on linear precedence functions, An alternative approach to the improvement of LR(k) parsers, Counter-one-pass features in one-pass compilation: A formalization using attribute grammars, Story parsing grammar, Algorithms for fast evaluation of Boolean expressions, Multipass precedence analysis, Support tools for the construction of discrete optimization software systems, Syntactic recognizer for expandable languages, Strict deterministic grammars, PEP: An interactive programming system with an Algol-like programming language, An implementation of Algol 68 for a small computer, OPTIMA—A portable PCODE optimizer, Translator design to support run-time debugging, A composite algorithm for strength reduction and code movement optimization, Interpretation and code generation based on intermediate languages, The design and implementation of parametric types in Pascal, A machine-independent approach to microprogram synthesis, An algebraic approach to data organization, Experience with a conversational parser generating system, A transportable extendable compiler, Computational complexity of formal translations, Compilation of linear partial differential equations into finite-difference programs, An error-correcting syntactic decoder for computer networks, Sequential syntactical decoding, Lektor-a list-oriented, machine-independent programming system for conversational applications, Syntax-directed correction of syntax errors, AUTOMATED ALGORITHM FINDING, A simplification of code tables in a one-pass PL/M compiler, A symbolic system for computer-aided development of surface interpolants, Interactive simulation on minicomputers, Non-recursive top-down syntax analysis