Theory: Difference between revisions
| Line 19: | Line 19: | ||
* Not closed under complement or difference | * Not closed under complement or difference | ||
* The intersection of an RL and CFL is a CFL, but CFLs are not closed under intersection | * The intersection of an RL and CFL is a CFL, but CFLs are not closed under intersection | ||
* Universality, language equality, language inclusion, and regularity are all undecidable given input CFLs | * Universality, language equality, language inclusion, and regularity are all undecidable given arbitrary input CFLs | ||
====Efficiently-Parsed CFLs==== | ====Efficiently-Parsed CFLs==== | ||
* LL(''n'') (Lewis and Stearns, 1968): | * LL(''n'') (Lewis and Stearns, 1968): | ||