The language represented by an encoded context-free grammar.
Equations
Instances For
The uniform membership predicate for encoded context-free grammars.
The input is a pair (G, w), with both the encoded grammar and the word freshly
provided to the predicate.
Equations
- contextFreeMembershipPredicate p = (p.2 ∈ contextFreeLanguageOf p.1)
Instances For
@[reducible, inline]
Uniform computability of membership for encoded context-free grammars,
relative to the language class C.