Formal Languages and Translators: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Programming#Formal_Languages_and_Translators|Programming}}") |
|||
| Line 1: | Line 1: | ||
=Internal= | =Internal= | ||
* [[Programming#Formal_Languages_and_Translators|Programming}} | * [[Programming#Formal_Languages_and_Translators|Programming]] | ||
=Context-Free Grammar= | |||
A set of production rules that describe all possible strings in a given formal language. A popular notation for context-free grammar is Backus-Naur (BNF). | |||
=Backus-Naur Form= | |||
{{External|https://en.wikipedia.org/wiki/Backus–Naur_form}} | |||
Revision as of 23:15, 7 June 2018
Internal
Context-Free Grammar
A set of production rules that describe all possible strings in a given formal language. A popular notation for context-free grammar is Backus-Naur (BNF).