Recognition and Parsing of Context-Free Languages in Time n^3¶

Younger, D. H. (1967). Recognition and Parsing of Context-Free Languages in Time n^3. Information and Control, 10(2), 189-208.

Type: Journal article
Intellectual base: Primary research
Year: 1967
DOI: 10.1016/s0019-9958(67)80007-x
Link: https://doi.org/10.1016/S0019-9958(67)80007-X
Cited from: computer_science

Cited by¶

1 citation across 1 artifact.

Primes¶

Parsing
- A flat sequence of length n has a combinatorial number of possible bracketings; a good grammar slashes that to a polynomial number of legal parses, often just one.

Verification¶

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:2b20a3f16d8b · see in the full table