Search code examples
regexgrammarcontext-free-grammarautomatapushdown-automaton

Regex is for Regular Grammars as to ____ is for Context Free Grammars

I have just learned that Regular Grammars have their corresponding Finite State Acceptors which will correspond to Regular Expressions.

Is there an equivalent conversion with Context Free Grammars? As far as I know Context Free Grammars can be represented by Push Down Automata which in turn would correspond to what?

Thanks to anyone who would clear my mind off of this.

Solution

  • From Wikipedia Context Free Grammar:

    a popular notation for context-free grammars is Backus–Naur Form

    …just as regexes are a notation for regular grammars.