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