A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars |
scientific article |
Statements
A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (English)
0 references
1983
0 references
context-free grammar
0 references
Greibach normal form
0 references
strict deterministic grammar
0 references
LL(k) grammar
0 references
branching algorithm
0 references
equivalence
0 references
skipping
0 references
0 references
0 references
