Cited in
(98)- Practical arbitrary lookahead LR parsing
- An experimental ambiguity detection tool
- AID: an alternative implementation of DCGs
- The ELL(1) parser generator and the error recovery mechanism
- scientific article; zbMATH DE number 1500722 (Why is no real title available?)
- Specific features of the control structure in the programming language MARKIZ
- scientific article; zbMATH DE number 400561 (Why is no real title available?)
- scientific article; zbMATH DE number 400581 (Why is no real title available?)
- scientific article; zbMATH DE number 225560 (Why is no real title available?)
- scientific article; zbMATH DE number 4033118 (Why is no real title available?)
- YakYak: Parsing with logical side constraints
- Looping LR parsers
- scientific article; zbMATH DE number 749664 (Why is no real title available?)
- From Tessellations to Table Interpretation
- Llun -- a high-level debugger for generated parsers
- Programmable program synthesis
- Declarative programming with algebra
- The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution
- Formal compiler construction in a logical framework
- RIGAL -- a programming language for compiler writing
- scientific article; zbMATH DE number 4100631 (Why is no real title available?)
- scientific article; zbMATH DE number 2024850 (Why is no real title available?)
- scientific article; zbMATH DE number 1472628 (Why is no real title available?)
- Parallélisation sémantique
- Bounded-connect noncanonical discriminating-reverse parsers.
- Towards semantic mathematical editing
- scientific article; zbMATH DE number 107703 (Why is no real title available?)
- An interpreter for LOTOS, a specification language for distributed systems
- A practical method for reducing sparse matrices with invariant entries
- Syntactic adaptability of programming languages
- A principled approach to grammars for controlled natural languages and predictive editors
- Awk — a pattern scanning and processing language
- ASF+SDF parsing tools applied to ELAN
- The Unix System and Software Reusability
- On regular tree languages and deterministic pushdown automata
- Qucs
- COBOL
- SugarCubes
- ToolBus
- MARKIZ
- ANTLR
- RIGAL
- CVXMOD
- YakYak
- BCEL
- APS
- M-SURGE
- Kermeta
- JFLAP
- E-Surge
- WExEd
- CCUBE
- Splint
- Bison
- LKB
- ALGOL 60
- GlassFish
- AWK
- PL/I
- DUAL
- groff
- Honalee
- Llun
- Qlose
- Rosette
- FlashMeta
- PADS
- BCPL
- Flex
- Euler
- GAG
- ToolMaker
- AceRules
- Hardware simulation in distributed computing systems: Methods and tools
- Reusing batch parsers as incremental parsers
- scientific article; zbMATH DE number 804368 (Why is no real title available?)
- scientific article; zbMATH DE number 1304450 (Why is no real title available?)
- Yacc in sasl — an exercise in functional programming
- parallel parsing from recurrence equations
- scientific article; zbMATH DE number 417592 (Why is no real title available?)
- scientific article; zbMATH DE number 1263458 (Why is no real title available?)
- scientific article; zbMATH DE number 785070 (Why is no real title available?)
- CVXGEN: a code generator for embedded convex optimization
- scientific article; zbMATH DE number 5585852 (Why is no real title available?)
- scientific article; zbMATH DE number 1822291 (Why is no real title available?)
- Grammar coverings of a deterministic parser with action conflicts
- An abstract, reusable, and extensible programming language design architecture
- Semi-automatic grammar recovery
- A framework for measuring the complexity of mathematical concepts
- A practical method for implementing string pattern matching machines
- A man-machine interface for computer-aided design and simulation of control systems
- scientific article; zbMATH DE number 1022228 (Why is no real title available?)
- scientific article; zbMATH DE number 804369 (Why is no real title available?)
- A semantic framework for proof evidence
- Silver: an extensible attribute grammar system
- Using linear positional grammars for the LR parsing of 2-D symbolic languages
- Solving optimisation problems using neucomp-a neural network compiler
- IDL-PMCFG, a grammar formalism for describing free word order languages
This page was built for software: YACC
