context-free language

Quick Reference

Any formal language generated by a context-free grammar or, equivalently from another viewpoint, any formal language recognized by a pushdown automaton. It can also be characterized as the frontier of a regular tree language, or as generated by term algebras (see initial algebra).

Subjects: Computing.

Reference entries