Parsing Context-Free Grammars

Aho, A. V. (2015). Parsing Context-Free Grammars.

Type

Web resource

Intellectual base

Web

Year

2015

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Context-Free Grammar
  • Membership in a CFG language is decidable and generically polynomial-time; equivalence of two arbitrary CFGs and ambiguity of an arbitrary CFG are undecidable.

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:afbd342bbf39 · see in the full table