scientific article; zbMATH DE number 5254145

zbMATH Open1155.68020MaRDI QIDQ5452362FDOQ5452362

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

Publication date: 26 March 2008

Title of this publication is not available (Why is that?)

Recommendations

scientific article; zbMATH DE number 814823
scientific article; zbMATH DE number 236850
Modern Compiler Implementation in Java
scientific article; zbMATH DE number 3843165
scientific article; zbMATH DE number 1027561
Compiler construction. Theory, design, generation
scientific article; zbMATH DE number 4016161
Compiler design. Syntactic and semantic analysis
scientific article; zbMATH DE number 814099
scientific article; zbMATH DE number 5912119

parallelism code optimization lexical analyzer parser 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)

Cited In (only showing first 100 items - show all)

Modern Compiler Implementation in Java
The complexity of regular(-like) expressions
On the implementation of automatic differentiation tools
Dynamic dictionary matching
EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES
ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES
BRNGLR: a cubic Tomita-style GLR parsing algorithm
LR error repair using the A* algorithm
An introduction to compilation issues for parallel machines
Regular expression simplification
Dataflow analysis of array and scalar references
Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages)
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
Deriving escape analysis by abstract interpretation
Research on closed-loop simulation system for digital AC servo system
Regular expressions at their best: a case for rational design
Properties of data flow frameworks: A unified model
Slicing programs in the presence of errors
The calculus of context relations
If the current clique algorithms are optimal, so is Valiant's parser
Approximating the buffer allocation problem using epochs
From flow logic to static type systems for coordination languages
Error detection, error correction and performance evaluation in on-line mathematical expression recognition
A Table Compression Method for Extended Aho-Corasick Automaton
How downwards causation occurs in digital computers
The time complexity of typechecking tree-walking tree transducers
Regular-expression derivatives re-examined
On regular tree languages and deterministic pushdown automata
Recursive descent parsing for Boolean grammars
Defining, analysing and implementing communication protocols using attribute grammars
The validation of SGML content models
Circular attribute grammars with remote attribute references and their evaluators
Interprocedural Induction Variable Analysis
Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
Generation of positive and negative tests for parsers
Krylov subspace spectral methods for the time-dependent Schrödinger equation with non-smooth potentials
High speed synchronization of processors using fuzzy barriers
Data flow analysis of distributed communicating processes
An operational semantics for paragon: A design notation for parallel architectures
Early action in an Earley parser
Context-free hypergraph grammars have the same term-generating power as attribute grammars
An efficient null-free procedure for deciding regular language membership
Algorithms for finding matrix models of propositional calculi
On the incremental growth and shrinkage of LR goto-graphs
Identifying approximately common substructures in trees based on a restricted edit distance
Test Data Generation of Bytecode by CLP Partial Evaluation
Component approach for construction of optimizing compilers
Automatic symmetry detection for Promela
Automated Generation of Positive and Negative Tests for Parsers
Uncle-attributed grammars
Modeling grammatical evolution by automaton
Hoare logic-based genetic programming
A predictive bottom-up parser
OSiL: An instance language for optimization
Regular expressions into finite automata
Minimal type inference for linked data consumers
Magic-sets for localised analysis of Java bytecode
Object-oriented description of graph data structures
Efficient SIMD optimization for media processors
Strengthening induction-based race checking with lightweight static analysis
One-sided random context grammars with leftmost derivations
Computation Tree Regular Logic for Genetic Regulatory Networks
Quantum automata theory -- a review
Transformational derivation of an improved alias analysis algorithm
GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
Modeling instruction semantics in ADL processor descriptions for C compiler retargeting
On the look-ahead problem in lexical analysis
From Tessellations to Table Interpretation
Traces of Control-Flow Graphs
Fast enumeration of words generated by Dyck grammars
Conjunctive abstract interpretation using paramodulation
Specifying and implementing visual process modeling languages with \textsc{DiaGen}
Model approach to grammatical evolution: deep-structured analyzing of model and representation
A new acceleration-based combination framework for array properties
Distinguishing redundant parentheses by syntax
Matrix-free convex optimization modeling
Automation of the construction of models of normal program behavior
SICStus Prolog -- the first 25 years
PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA
ASF+SDF parsing tools applied to ELAN
Recognition is not parsing - SPPF-style parsing from cubic recognisers
A program auto-parallelizer based on the component technology of optimizing compiler construction
Tolerating radiation-induced transient faults in modern processors
May-happen-in-parallel analysis for actor-based concurrency
Partial derivatives for context-free languages. From \(\mu\)-regular expressions to pushdown automata
Logical approximation for program analysis
Typed quote/antiquote or: compile-time parsing
Title not available (Why is that?)
Composing stack-attributed tree transducers
Secure evolvable hardware for public-key cryptosystems
Analyzing Real-Time Event-Driven Programs
Fast deterministic parsers for transition networks
Descending chains and narrowing on template abstract domains
Optimal loop storage allocation for argument-fetching dataflow machines
Profile-assisted instruction scheduling
Modelling of electromechanical systems with switch circuits by using transmission elements
Title not available (Why is that?)
Parallelization of WHILE loops on pipelined architectures

Uses Software

SableCC

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452362)