Formal Languages and Translators: Difference between revisions
Jump to navigation
Jump to search
| Line 11: | Line 11: | ||
{{External|https://en.wikipedia.org/wiki/Backus–Naur_form}} | {{External|https://en.wikipedia.org/wiki/Backus–Naur_form}} | ||
Backus-Naur form is notation technique for [[#Context-Free_Grammar|context-free grammars]] | Backus-Naur form is notation technique for [[#Context-Free_Grammar|context-free grammars]] that is used to describe the syntax of languages used in computing. | ||
Revision as of 23:16, 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).
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.