Langlib

Langlib.Classes.ContextFree.Decidability.Helper

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
    Instances For
      @[reducible, inline]

      Uniform computability of membership for encoded context-free grammars, relative to the language class C.

      Equations
      Instances For