A direct algorithm for checking equivalence of LL(k) grammars
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3490487 (Why is no real title available?)
- scientific article; zbMATH DE number 3576680 (Why is no real title available?)
- scientific article; zbMATH DE number 3439971 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A direct algorithm for checking equivalence of LL(k) grammars
- Completeness results for the equivalence of recursive schemas
- Decidable Properties of Monadic Functional Schemas
- Functional schemas with nested predicates
- Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
- Optimization of LR(k) parsers
- Properties of deterministic top-down grammars
- Simple program schemes and formal languages
Cited in
(11)- A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars
- A direct algorithm for checking equivalence of LL(k) grammars
- A fast algorithm to decide on the equivalence of stateless DPDA
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- The equivalence problem for LL- and LR-regular grammars
- Superdeterministic DPDAs: The method of accepting does affect decision problems
- Synchronizable deterministic pushdown automata and the decidability of their equivalence
- An axiomatic approach to the Korenjak-Hopcroft algorithms
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
- On equivalence of grammars through transformation trees
This page was built for publication: A direct algorithm for checking equivalence of LL(k) grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1238431)
