Formal Languages and Translators: Difference between revisions
Jump to navigation
Jump to search
| Line 24: | Line 24: | ||
<span id='Production'></span>'''Production''' | <span id='Production'></span>'''Production''' | ||
<span id='Production_Head'></span>'''Production head''' | |||
<span id='Terminal'></span>'''Terminal''' | <span id='Terminal'></span>'''Terminal''' | ||
Revision as of 21:03, 13 July 2018
Internal
Overview
Compiler
Interpreter
Lexical Analysis
Regular Expressions
Finite Automata
Syntax Analysis (Parsing)
TODO Deplete This Parsing
Grammar
Derivation
Production
Production head
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 and it is labeled with the name of the nonterminal that is the head of the production. A parse tree does not contain the information that reflects the order in which productions are applied to replace nonterminals.