In Chapter 3 we gave an introduction to the lexical analysis, i.e. we showed how the scanner recognizes the symbols within the character stream of the source code. These symbol sequences are sequentially analyzed by the parser. Thus, the parser decides whether a certain sequence of symbols will be accepted by the considered programming language.
KeywordsParse Tree Input String Input Symbol Terminal Symbol Finite Deterministic Automaton
Unable to display preview. Download preview PDF.