User:Jochen Burghardt/sandbox6

Chomsky hierarchy
Legend:

To be inserted:
 * LALR
 * SLR
 * Mildly_context-sensitive_language
 * regular tree languages (flattened to strings)
 * automata from Template_talk:Formal_languages_and_grammars where appropriate

known relations: 
 * according to SLR grammar: LR(0) ⊆ SLR ⊆ LALR(1) and SLR ⊆ LR(1)
 * according to LL grammar/Beatty, J.C. (1982): p-reduced LL(1) ⊆ LALR(1) and Λ-free LL(1) ⊆ SLR(1)
 * according to LALR: LL(j) \ LALR(k) ≠ {} ≠ LALR(k) \ LL(j) for every j,k > 0 and it is undecidable whether a given LL(1) grammar is LALR(k) for any k≥0
 * according to LR_parser: LR(0) = (deterministic context-free) ∩ (prefix property)

Chomsky hierarchy (Old)
Legend:

Language classes in a table cell are weakly equivalent.

To be inserted:
 * LALR
 * SLR
 * Mildly_context-sensitive_language
 * regular tree languages (flattened to strings)
 * automata from Template_talk:Formal_languages_and_grammars where appropriate

known relations:
 * according to SLR grammar: LR(0) ⊆ SLR ⊆ LALR(1) and SLR ⊆ LR(1)
 * according to LL grammar/Beatty, J.C. (1982): p-reduced LL(1) ⊆ LALR(1) and Λ-free LL(1) ⊆ SLR(1)
 * according to LALR: LL(j) \ LALR(k) ≠ {} ≠ LALR(k) \ LL(j) for every j,k > 0 and it is undecidable whether a given LL(1) grammar is LALR(k) for any k≥0