scrambled
Home//Concepts/Bnf
scrambled
Overviewjust now
154
2
4
1082
3
2
24
633
Dimensional inference rule formatjust nowAbstract binding graphjust nowAbstract binding tree abtjust nowAbstract binding tree abt valence abstractorjust nowAbstract data typejust now
408
11
4
Overviewjust now
154
2
4
1082
3
2
24
633
Dimensional inference rule formatjust nowAbstract binding graphjust nowAbstract binding tree abtjust nowAbstract binding tree abt valence abstractorjust nowAbstract data typejust now
408
11
4
Concept

Bnf

Modified just now
Books
  • Chapter 3. Untyped arithmetic expressions
JourneyProgramming Language Theory Statuslearning

A Metalanguage notation for specifying Context-free grammars, using production rules of the form <nonterminal>::=expression\text{<nonterminal>} ::= \text{expression}<nonterminal>::=expression to define the syntax of formal languages.

Previous in ConceptsBlockNext in Concepts Boolean blindness
Books
  • Chapter 3. Untyped arithmetic expressions
JourneyProgramming Language Theory
Statuslearning