scientific article; zbMATH DE number 5254145

A. V. Aho, Jeffrey D. Ullman, Ravi Sethi, Monica S. Lam

Publication date: 26 March 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

parallelism parser code optimization lexical analyzer abstract syntax tree object code intermediate code run-time environment

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of compilers and interpreters (68N20)

Related Items (only showing first 100 items - show all)

Profile-assisted instruction scheduling ⋮ SICStus Prolog—The first 25 years ⋮ Dynamic dictionary matching ⋮ One-Sided Random Context Grammars with Leftmost Derivations ⋮ Unnamed Item ⋮ Specification, verification and prototyping of an optimized compiler ⋮ Combining Model Checking and Data-Flow Analysis ⋮ THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS ⋮ On the look-ahead problem in lexical analysis ⋮ From Safety Critical Java Programs to Timed Process Models ⋮ Recursive descent parsing for Boolean grammars ⋮ Deriving escape analysis by abstract interpretation ⋮ If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser ⋮ Modeling grammatical evolution by automaton ⋮ Recognition is not parsing - SPPF-style parsing from cubic recognisers ⋮ The validation of SGML content models ⋮ A program auto-parallelizer based on the component technology of optimizing compiler construction ⋮ Descending chains and narrowing on template abstract domains ⋮ Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages) ⋮ Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach ⋮ An algorithm for dynamic processing of dawg's ⋮ Logical approximation for program analysis ⋮ PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA ⋮ Matrix-Free Convex Optimization Modeling ⋮ Regular expression simplification ⋮ Conjunctive Abstract Interpretation Using Paramodulation ⋮ A New Acceleration-Based Combination Framework for Array Properties ⋮ Modeling instruction semantics in ADL processor descriptions for C compiler retargeting ⋮ Model approach to grammatical evolution: deep-structured analyzing of model and representation ⋮ A unifying view on SMT-based software verification ⋮ Approximating the buffer allocation problem using epochs ⋮ Properties of data flow frameworks: A unified model ⋮ Uncle-attributed grammars ⋮ A predictive bottom-up parser ⋮ The calculus of context relations ⋮ Defining, analysing and implementing communication protocols using attribute grammars ⋮ Nominal Automata with Name Binding ⋮ Partial Derivatives for Context-Free Languages ⋮ Computation Tree Regular Logic for Genetic Regulatory Networks ⋮ Object-oriented description of graph data structures ⋮ On the incremental growth and shrinkage of LR goto-graphs ⋮ Magic-sets for localised analysis of Java bytecode ⋮ Efficient SIMD optimization for media processors ⋮ Identifying approximately common substructures in trees based on a restricted edit distance ⋮ BRNGLR: a cubic Tomita-style GLR parsing algorithm ⋮ Algorithms for finding matrix models of propositional calculi ⋮ Dataflow analysis of array and scalar references ⋮ Parallelization of WHILE loops on pipelined architectures ⋮ Modelling of electromechanical systems with switch circuits by using transmission elements ⋮ Typed quote/antiquote or: Compile-time parsing ⋮ Context-free hypergraph grammars have the same term-generating power as attribute grammars ⋮ Automation of the construction of models of normal program behavior ⋮ From flow logic to static type systems for coordination languages ⋮ Circular attribute grammars with remote attribute references and their evaluators ⋮ Specifying and Implementing Visual Process Modeling Languages with DiaGen1 1Support by the Esprit Working Group AppliGraph is gratefully acknowledged. ⋮ Hoare logic-based genetic programming ⋮ LR error repair using the A* algorithm ⋮ An introduction to compilation issues for parallel machines ⋮ Secure evolvable hardware for public-key cryptosystems ⋮ Tolerating radiation-induced transient faults in modern processors ⋮ OSiL: An instance language for optimization ⋮ ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES ⋮ Composing stack-attributed tree transducers ⋮ Generation of positive and negative tests for parsers ⋮ A novel analysis space for pointer analysis and its application for bug finding ⋮ The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution ⋮ Type inference and strong static type checking for Promela ⋮ An Introduction to Grammar Convergence ⋮ Fast deterministic parsers for transition networks ⋮ ON FORMAL AND COGNITIVE SEMANTICS FOR SEMANTIC COMPUTING ⋮ How downwards causation occurs in digital computers ⋮ Regular-expression derivatives re-examined ⋮ Test Data Generation of Bytecode by CLP Partial Evaluation ⋮ Regular Expressions at Their Best: A Case for Rational Design ⋮ Strengthening Induction-Based Race Checking with Lightweight Static Analysis ⋮ The time complexity of typechecking tree-walking tree transducers ⋮ High speed synchronization of processors using fuzzy barriers ⋮ Data flow analysis of distributed communicating processes ⋮ Traces of Control-Flow Graphs ⋮ From Tessellations to Table Interpretation ⋮ Slicing programs in the presence of errors ⋮ A Table Compression Method for Extended Aho-Corasick Automaton ⋮ An operational semantics for paragon: A design notation for parallel architectures ⋮ Optimizing Pointer Analysis Using Bisimilarity ⋮ Quantum Automata Theory – A Review ⋮ Krylov subspace spectral methods for the time-dependent Schrödinger equation with non-smooth potentials ⋮ On the implementation of automatic differentiation tools ⋮ Analyzing Real-Time Event-Driven Programs ⋮ On regular tree languages and deterministic pushdown automata ⋮ Early action in an Earley parser ⋮ Component approach for construction of optimizing compilers ⋮ An efficient null-free procedure for deciding regular language membership ⋮ Automatic symmetry detection for Promela ⋮ Research on closed-loop simulation system for digital AC servo system ⋮ Fast enumeration of words generated by Dyck grammars ⋮ Automated Generation of Positive and Negative Tests for Parsers ⋮ Regular expressions into finite automata ⋮ Minimal type inference for linked data consumers ⋮ Optimal loop storage allocation for argument-fetching dataflow machines ⋮ Transformational derivation of an improved alias analysis algorithm

Uses Software

SableCC

This page was built for publication: