Language - Nonterminal Symbol

Compiler

About

A symbol or token is called non terminal when it does not appear in the resulting formal language.

They are derived token that are expressed via a rule with a regular expression that contains:

Example

In a the following context free grammar

A -> a
A -> b
  • The symbol A will never appears in the language.
  • The language is composed of a and b but not A

A is then nonterminal symbol.

Documentation / Reference





Discover More
Compiler
Grammar - Start Symbol

A start symbol is a special nonterminal symbol that appears in the initial string generated by the grammar.
Compiler
Language - Context Free Grammar (CFG)

A context-free grammar is: a set of instructions called grammar rules (known as production rules or production) that describe all possible strings in a given formal language without context ...
Compiler
Language - Terminal (Symbol|Token)

A symbol or token is called terminal when it appears in the resulting formal language. Terminal Symbol are the characters of the alphabet that appear in the strings generated by the grammar. context-free...
Compiler
Lexical Analysis - (Token|Lexical unit|Lexeme|Symbol|Word)

A token is symbols of the vocabulary of the language. Each token is a single atomic unit of the language. The token syntax is typically a regular language, so a finite state automaton constructed from...
Compiler
What is a Railroad Diagram? known as Syntax diagram

A Railroad is a diagram that permits to visualize a grammar (Same as a process flow) With RRDiagram and BNF syntax of H2 select SQL A Railroad diagram is made of: a main diagram a set of syntax...



Share this page:
Follow us:
Task Runner