Formal Languages and Translators: Difference between revisions
Jump to navigation
Jump to search
| Line 17: | Line 17: | ||
{{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]] that is used to describe the syntax of languages used in computing. | 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. | ||
A BNF specification is a set of derivation rules, written as: | |||
<symbol> ::= expression | |||
===Extended Backus-Naur form EBNF=== | ===Extended Backus-Naur form EBNF=== | ||
Revision as of 23:27, 7 June 2018
Internal
Formal Grammars
A set of production rules that describe all possible strings in a given formal language. The rules describe how to form strings from the language's alphabet that are valid according to the language syntax. The grammar does not describe the meaning of strings, or what can be done with them in whatever context, only their form.
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 BNF
Backus-Naur form is notation technique for context-free grammars that is used to describe the syntax of languages used in computing.
A BNF specification is a set of derivation rules, written as:
<symbol> ::= expression
Extended Backus-Naur form EBNF
Syntax Tree
Parser Generators
ANTLR