TAILIEUCHUNG - Compiler construction: Lecture 9, 10 - Majid Mumtaz

The following will be discussed in this chapter: The role of lexical analyzer, lexical analysis vs parsing, recall, example, regular expressions, regular expressions – algebraic laws, alternative notations,. Inviting you to refer. | Compiler Construction Week-5 Lecture 9-10 Majid Mumtaz Department of Computer Science CIIT Wah 1 The Role of Lexical Analyzer Primary Role - Read the input characters of the source program Group them into lexemes Produce a sequence of tokens for each lexeme Secondary Role Interacting with the symbol table If a lexeme constitutes an identifier . variables types subroutines etc. it needs to be entered into the symbol table This information can be read later on in order to determine the appropriate token to pass on to the parser for syntax analysis . 2 The Role of Lexical Analyzer Secondary Role Removing comments and whitespace - Blank newline tab - Other characters that are used to separate tokens in the source input code . colon Secondary Role Correlating error messages generated by the compiler with the source code - Keeping track of the number of newline characters seen in order to associate a line number with each error message - Making a copy of the source program and inserting the error messages at the appropriate positions.

• Kỹ thuật lập trình
• Compiler construction
• Lecture Compiler construction
• Lexical analyzer
• Role of lexical analyzer
• Regular expressions
• Regular definitions
• Structure of compiler
• Compiler construction tools
• Programing languages generation
• Grouping of phases into passes
• Bài giảng Xây dựng trình biên dịch
• DFA construction
• Subset construction
• Deterministic finite automata
• Learning management system
• Syntax directed translator
• Intermediate code generation
• Two pass compiler
• Intermediate representation
• Maps character stream
• Three pass compiler
• Typical transformations
• Memory management
• Intermediate representations
• Compiler derives facts
• Record additional information
• LL(1) table construction
• Left factoring
• Single token lookahead
• LR table construction
• String of grammar symbols
• Expression grammar string
• Computing FIRST sets
• Computing FOLLOW sets
• Table construction
• Finite automaton
• Augmented grammar
• High level source code
• Low level machine code
• Assembly code
• Syntax tree
• Abstract syntax tree
• System interfaces
• Lexical analysis
• Hand write code
• Tokenizer automatically
• Regular languages
• Regular expression
• Finite automata
• Table encoding of FA
• Nondeterministic finite automaton
• DFA minimization
• Hopcroft’s algorithm
• Optimized acceptor
• Front End parser
• Syntactic analysis
• Natural language analogy
• Parse trees
• Algebraic expressions
• The terminal symbols
• Ambiguous grammars
• Parsing techniques
• Bottom up parsers
• Top down parsers
• Predictive parsing
• Recursive descent parsing
• Mutually recursive routin
• Recusive descent parser
• Grammatically correct
• Non recursive predictive parsing
• Table driven parsers
• Predictive parsing table
• Bottom up parsing
• Left factored grammars
• Left recursive grammars