Formal Languages and Translators: Difference between revisions
Jump to navigation
Jump to search
| Line 7: | Line 7: | ||
{{External|https://en.wikipedia.org/wiki/Formal_grammar}} | {{External|https://en.wikipedia.org/wiki/Formal_grammar}} | ||
=Context-Free Grammar= | ==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). | 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). | ||
Revision as of 23:17, 7 June 2018
Internal
Formal Grammars
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.