Formal Languages and Translators

Internal

• Programming

Formal Grammars

https://en.wikipedia.org/wiki/Formal_grammar

Context-Free Grammar

A context-free grammar is a grammar in which the left-hand side of each production rule consists of only a single nonterminal symbol. A popular notation for context-free grammar is Backus-Naur (BNF).

Backus-Naur Form

https://en.wikipedia.org/wiki/Backus–Naur_form

Backus-Naur form is notation technique for context-free grammars that is used to describe the syntax of languages used in computing.