scientific article; zbMATH DE number 5344975
From MaRDI portal
Publication:3525697
zbMATH Open1429.68002MaRDI QIDQ3525697FDOQ3525697
Authors: A. V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman 
Publication date: 18 September 2008
Title of this publication is not available (Why is that?)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of compilers and interpreters (68N20)
Cited In (47)
- Explaining safety violations in real-time systems
- Feynman integral evaluation by a sector decomposition approach (FIESTA)
- From Regular Expression Matching to Parsing
- Optimizing reversible programs
- Optimization of reversible control flow graphs
- Spot the difference: a detailed comparison between B and Event-B
- One-unambiguous regular languages
- GUBS a Language for Synthetic Biology: Specification and Compilation
- Neural software vulnerability analysis using rich intermediate graph representations of programs
- Title not available (Why is that?)
- Distributing and parallelizing non-canonical loops
- A higher-order strategy for eliminating common subexpressions
- Optimizing the stack size of recursive functions
- An extension of lazy abstraction with interpolation for programs with arrays
- Title not available (Why is that?)
- Regular numeral systems for data structures
- Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions
- Code optimization in FORM
- EFFECTIVE TRANSLATION FOR LL(1)-GRAMMAR IN THE EXAMPLE OF A PROGRAMMING LANGUAGE
- Robotic system specification language use case
- Model approach to grammatical evolution: theory and case study
- Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification
- One-unambiguous regular languages
- Certified abstract cost analysis
- From regular expression matching to parsing
- Some observations on LR-like parsing with delayed reduction
- Compiling Janus to RSSA
- Title not available (Why is that?)
- On the complexity of a linear ordering of weighted directed acyclic graphs
- Operator precedence and the visibly pushdown property
- Improving multivariate Horner schemes with Monte Carlo tree search
- Simplification of genetic programs: a literature survey
- Fast matching of regular patterns with synchronizing counting
- Property-oriented expansion
- MINIMIZATION OF CONTEXT-FREE GRAMMARS
- Distinct fringe subtrees in random trees
- An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type
- Extension of superblock technique to hyperblock using predicate hierarchy graph
- Efficiency issues in the KBMAG procedure
- Automatic synthesis of data-flow analyzers
- Correct approximation of IEEE 754 floating-point arithmetic for program verification
- New Developments in Parsing Mizar
- Non-Self-Embedding Grammars and Descriptional Complexity
- Systematic discovery of the grammar of translational inhibition by RNA hairpins
- On typical hesitant fuzzy languages and automata
- Generalized dominators for structured programs
- A Survey of the Proof-Theoretic Foundations of Logic Programming
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 Q3525697)
