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