Formal Languages and Translators: Difference between revisions
Jump to navigation
Jump to search
| Line 26: | Line 26: | ||
==Parse Tree== | ==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. | |||
==<span id='Syntax_Tree'></span>(Abstract) Syntax Tree== | ==<span id='Syntax_Tree'></span>(Abstract) Syntax Tree== | ||
Revision as of 20:56, 13 July 2018
Internal
Overview
Compiler
Interpreter
Lexical Analysis
Regular Expressions
Finite Automata
Syntax Analysis (Parsing)
TODO Deplete This Parsing
Grammar
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.