A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:23, 1 February 2024
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
