Formal Languages and Translators: Difference between revisions

From NovaOrdis Knowledge Base
Jump to navigation Jump to search
Line 9: Line 9:
==Context-Free Grammar==
==Context-Free Grammar==


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. A popular notation for context-free grammar is Backus-Naur (BNF).
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=
=Backus-Naur Form=

Revision as of 23:21, 7 June 2018

Internal

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.

Retrieved from "https://kb.novaordis.com/index.php?title=Formal_Languages_and_Translators&oldid=45407"