Formal Languages and Translators: Difference between revisions
Jump to navigation
Jump to search
| Line 22: | Line 22: | ||
<span id='Derivation'></span>'''Derivation''' | <span id='Derivation'></span>'''Derivation''' | ||
<span id='Production'></span>'''Production''' | <span id='Production'></span>'''Production''' | ||
<span id='Terminal'></span>'''Terminal''' | |||
<span id='Nonterminal'></span>'''Nonterminal''' | |||
Revision as of 20:59, 13 July 2018
Internal
Overview
Compiler
Interpreter
Lexical Analysis
Regular Expressions
Finite Automata
Syntax Analysis (Parsing)
TODO Deplete This Parsing
Grammar
Derivation
Production
Terminal
Nonterminal
Backus-Naur Form (BNF)
Extended Backus-Naur Form (EBNF)
Parse Tree
A parse tree is a graphical representation of a derivation. Each interior node of a parse tree represents the application of a production. A parse tree does not contain the information that reflects the order in which productions are applied to replace nonterminals.