Your SlideShare is downloading. ×
0
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Lexical analyzer
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Lexical analyzer

22,134

Published on

mam gave it.

mam gave it.

Published in: Education, Technology
6 Comments
19 Likes
Statistics
Notes
No Downloads
Views
Total Views
22,134
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
1,430
Comments
6
Likes
19
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide
  • lec00-outline August 9, 2011
  • Transcript

    • 1. CS40106 Compiler Design Compiler Design 40106
    • 2. <ul><li>Prerequisites: </li></ul><ul><li>Automata Theory: DFAs, NFAs, Regular Expressions </li></ul><ul><li>Textbook: </li></ul><ul><li>Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman, </li></ul><ul><li>“ Compilers: Principles, Techniques, and Tools ” </li></ul><ul><li>Addison-Wesley, 1986. </li></ul><ul><li>K. Cooper, L. Torczon, ‘Engineering a Compiler’, Morgan Kaufmann, 1 st Edition, 2003 </li></ul>Compiler Design 40106
    • 3. Course Outline <ul><li>Introduction to Compiling </li></ul><ul><li>Lexical Analysis </li></ul><ul><li>Syntax Analysis </li></ul><ul><ul><li>Context Free Grammars </li></ul></ul><ul><ul><li>Top-Down Parsing, LL Parsing </li></ul></ul><ul><ul><li>Bottom-Up Parsing, LR Parsing </li></ul></ul><ul><li>Syntax-Directed Translation </li></ul><ul><ul><li>Attribute Definitions </li></ul></ul><ul><ul><li>Evaluation of Attribute Definitions </li></ul></ul><ul><li>Semantic Analysis, Type Checking </li></ul><ul><li>Run-Time Organization </li></ul><ul><li>Intermediate Code Generation </li></ul><ul><li>Code Optimization </li></ul>Compiler Design 40106
    • 4. COMPILERS <ul><li>A compiler is a program takes a program written in a source language and translates it into an equivalent program in a target language. </li></ul><ul><li>source program COMPILER target program </li></ul><ul><li>error messages </li></ul>Compiler Design 40106 ( Normally a program written in a high-level programming language) ( Normally the equivalent program in machine code – relocatable object file)
    • 5. Other Applications <ul><li>In addition to the development of a compiler, the techniques used in compiler design can be applicable to many problems in computer science. </li></ul><ul><ul><li>Techniques used in a lexical analyzer can be used in text editors, information retrieval system, and pattern recognition programs. </li></ul></ul><ul><ul><li>Techniques used in a parser can be used in a query processing system such as SQL. </li></ul></ul><ul><ul><li>A symbolic equation solver which takes an equation as input. That program should parse the given input equation. </li></ul></ul><ul><ul><li>Most of the techniques used in compiler design can be used in Natural Language Processing (NLP) systems. </li></ul></ul>Compiler Design 40106
    • 6. Major Parts of Compilers <ul><li>There are two major parts of a compiler: Analysis and Synthesis </li></ul><ul><li>In analysis phase, an intermediate representation is created from the given source program. </li></ul><ul><ul><li>Lexical Analyzer, Syntax Analyzer and Semantic Analyzer are the parts of this phase. </li></ul></ul><ul><li>In synthesis phase, the equivalent target program is created from this intermediate representation. </li></ul><ul><ul><li>Intermediate Code Generator, Code Generator, and Code Optimizer are the parts of this phase. </li></ul></ul>Compiler Design 40106
    • 7. Phases of A Compiler Compiler Design 40106 Lexical Analyzer Semantic Analyzer Syntax Analyzer Intermediate Code Generator Code Optimizer Code Generator Target Program Source Program <ul><li>Each phase transforms the source program from one representation into another representation. </li></ul><ul><li>They communicate with error handlers. </li></ul><ul><li>They communicate with the symbol table. </li></ul>
    • 8. 1. Lexical Analyzer <ul><li>Lexical Analyzer reads the source program character by character and returns the tokens of the source program. </li></ul><ul><li>A token describes a pattern of characters having same meaning in the source program. (such as identifiers, operators, keywords, numbers, delimeters and so on) </li></ul><ul><li>Ex : newval := oldval + 12 =&gt; tokens: newval identifier </li></ul><ul><li>:= assignment operator </li></ul><ul><li>oldval identifier </li></ul><ul><li>+ add operator </li></ul><ul><li>12 a number </li></ul><ul><li>Puts information about identifiers into the symbol table. </li></ul><ul><li>Regular expressions are used to describe tokens (lexical constructs). </li></ul><ul><li>A (Deterministic) Finite State Automaton can be used in the implementation of a lexical analyzer. </li></ul>Compiler Design 40106
    • 9. 2. Syntax Analyzer <ul><li>A Syntax Analyzer creates the syntactic structure (generally a parse tree) of the given program. </li></ul><ul><li>A syntax analyzer is also called as a parser . </li></ul><ul><li>A parse tree describes a syntactic structure. </li></ul><ul><li>assgstmt </li></ul><ul><li>identifier := expression </li></ul><ul><li>newval expression + expression </li></ul><ul><li> identifier number </li></ul><ul><li> oldval 12 </li></ul>Compiler Design 40106 <ul><li>In a parse tree, all terminals are at leaves. </li></ul><ul><li>All inner nodes are non-terminals in </li></ul><ul><li>a context free grammar. </li></ul>
    • 10. Syntax Analyzer (CFG) <ul><li>The syntax of a language is specified by a context free grammar (CFG). </li></ul><ul><li>The rules in a CFG are mostly recursive. </li></ul><ul><li>A syntax analyzer checks whether a given program satisfies the rules implied by a CFG or not. </li></ul><ul><ul><li>If it satisfies, the syntax analyzer creates a parse tree for the given program. </li></ul></ul><ul><li>Ex: We use BNF (Backus Naur Form) to specify a CFG </li></ul><ul><li>assgstmt -&gt; identifier := expression </li></ul><ul><li>expression -&gt; identifier </li></ul><ul><li>expression -&gt; number </li></ul><ul><li>expression -&gt; expression + expression </li></ul>Compiler Design 40106
    • 11. Syntax Analyzer versus Lexical Analyzer <ul><li>Which constructs of a program should be recognized by the lexical analyzer, and which ones by the syntax analyzer? </li></ul><ul><ul><li>Both of them do similar things; But the lexical analyzer deals with simple non-recursive constructs of the language. </li></ul></ul><ul><ul><li>The syntax analyzer deals with recursive constructs of the language. </li></ul></ul><ul><ul><li>The lexical analyzer simplifies the job of the syntax analyzer. </li></ul></ul><ul><ul><li>The lexical analyzer recognizes the smallest meaningful units (tokens) in a source program. </li></ul></ul><ul><ul><li>The syntax analyzer works on the smallest meaningful units (tokens) in a source program to recognize meaningful structures in our programming language. </li></ul></ul>Compiler Design 40106
    • 12. Parsing Techniques <ul><li>Depending on how the parse tree is created, there are different parsing techniques. </li></ul><ul><li>These parsing techniques are categorized into two groups: </li></ul><ul><ul><li>Top-Down Parsing, </li></ul></ul><ul><ul><li>Bottom-Up Parsing </li></ul></ul><ul><li>Top-Down Parsing: </li></ul><ul><ul><li>Construction of the parse tree starts at the root, and proceeds towards the leaves. </li></ul></ul><ul><ul><li>Efficient top-down parsers can be easily constructed by hand. </li></ul></ul><ul><ul><li>Recursive Predictive Parsing, Non-Recursive Predictive Parsing (LL Parsing). </li></ul></ul><ul><li>Bottom-Up Parsing: </li></ul><ul><ul><li>Construction of the parse tree starts at the leaves, and proceeds towards the root. </li></ul></ul><ul><ul><li>Normally efficient bottom-up parsers are created with the help of some software tools. </li></ul></ul><ul><ul><li>Bottom-up parsing is also known as shift-reduce parsing. </li></ul></ul><ul><ul><li>Operator-Precedence Parsing – simple, restrictive, easy to implement </li></ul></ul><ul><ul><li>LR Parsing – much general form of shift-reduce parsing, LR, SLR, LALR </li></ul></ul>Compiler Design 40106
    • 13. 3. Semantic Analyzer <ul><li>A semantic analyzer checks the source program for semantic errors and collects the type information for the code generation. </li></ul><ul><li>Type-checking is an important part of semantic analyzer. </li></ul><ul><li>Context-free grammars used in the syntax analysis are integrated with attributes (semantic rules) </li></ul><ul><ul><li>the result is a syntax-directed translation, </li></ul></ul><ul><ul><li>Attribute grammars </li></ul></ul><ul><li>Ex: </li></ul><ul><ul><li>newval := oldval + 12 </li></ul></ul><ul><ul><ul><li>The type of the identifier newval must match with type of the expression (oldval+12) </li></ul></ul></ul>Compiler Design 40106
    • 14. 4. Intermediate Code Generation <ul><li>A compiler may produce an explicit intermediate codes representing the source program. </li></ul><ul><li>These intermediate codes are generally machine (architecture independent). But the level of intermediate codes is close to the level of machine codes. </li></ul><ul><li>Ex: </li></ul><ul><ul><li>newval := oldval * fact + 1 </li></ul></ul><ul><ul><li>id1 := id2 * id3 + 1 </li></ul></ul><ul><ul><li>temp1 := id2 * id3 Intermediates Codes (three address code) </li></ul></ul><ul><ul><li>temp2 := temp1 + 1 </li></ul></ul><ul><ul><li>id1 := temp2 </li></ul></ul>Compiler Design 40106
    • 15. Intermediate Code Generation <ul><li>Properties of IR- </li></ul><ul><li>Easy to produce </li></ul><ul><li>Easy to translate into the target program </li></ul><ul><li>IR can be in following forms- </li></ul><ul><li>Syntax trees </li></ul><ul><li>Postfix notation </li></ul><ul><li>Three address statements </li></ul><ul><li>Properties of three address statements- </li></ul><ul><li>At most one operator in addition to an assignment operator </li></ul><ul><li>Must generate temporary names to hold the value computed at each </li></ul><ul><li>instruction </li></ul><ul><li> Some instructions have fewer than three operands </li></ul>Compiler Design 40106
    • 16. 5. Code Optimizer (for Intermediate Code Generator) <ul><li>The code optimizer optimizes the code produced by the intermediate code generator in the terms of time and space. </li></ul><ul><li>Ex: </li></ul><ul><ul><li>temp1 := id2 * id3 </li></ul></ul><ul><ul><li>id1 := temp1 + 1 </li></ul></ul>Compiler Design 40106
    • 17. 6. Code Generator <ul><li>Produces the target language in a specific architecture. </li></ul><ul><li>The target program is normally a relocatable object file containing the machine code or assembly code. </li></ul><ul><li>Intermediate instructions are each translated into a sequence of machine instructions that perform the same task. </li></ul><ul><li>Ex: </li></ul><ul><li>( assume that we have an architecture with instructions whose at least one of its operands is </li></ul><ul><li>a machine register) </li></ul><ul><ul><li>MOVE id2,R1 </li></ul></ul><ul><ul><li>MULT id3,R1 </li></ul></ul><ul><ul><li>ADD #1,R1 </li></ul></ul><ul><ul><li>MOVE R1,id1 </li></ul></ul>Compiler Design 40106
    • 18. Phases of compiler Compiler Design 40106
    • 19. Compiler Design 40106
    • 20. The Structure of a Compiler (8) Scanner [Lexical Analyzer] Parser [Syntax Analyzer] Semantic Process [Semantic analyzer] Code Generator [Intermediate Code Generator] Code Optimizer Parse tree Abstract Syntax Tree w/ Attributes Non-optimized Intermediate Code Optimized Intermediate Code Code Genrator Target machine code Compiler Design 40106 Tokens
    • 21. The input program as you see it. main () { int i,sum; sum = 0; for (i=1; i&lt;=10; i++); sum = sum + i; printf(&amp;quot;%dn&amp;quot;,sum); } Compiler Design 40106
    • 22. Compiler Design 40106
    • 23. Compiler Design 40106
    • 24. Compiler Design 40106
    • 25. Compiler Design 40106
    • 26. Compiler Design 40106
    • 27. Compiler Design 40106
    • 28. Compiler Design 40106
    • 29. Compiler Design 40106
    • 30. Compiler Design 40106
    • 31. Compiler Design 40106
    • 32. Compiler Design 40106
    • 33. Compiler Design 40106
    • 34. Introducing Basic Terminology <ul><li>What are Major Terms for Lexical Analysis? </li></ul><ul><ul><li>TOKEN </li></ul></ul><ul><ul><ul><li>A classification for a common set of strings </li></ul></ul></ul><ul><ul><ul><li>Examples Include &lt;Identifier&gt;, &lt;number&gt;, etc. </li></ul></ul></ul><ul><ul><li>PATTERN </li></ul></ul><ul><ul><ul><li>The rules which characterize the set of strings for a token </li></ul></ul></ul><ul><ul><ul><li>Recall File and OS Wildcards ([A-Z]*.*) </li></ul></ul></ul><ul><ul><li>LEXEME </li></ul></ul><ul><ul><ul><li>Actual sequence of characters that matches pattern and is classified by a token </li></ul></ul></ul><ul><ul><ul><li>Identifiers: x, count, name, etc… </li></ul></ul></ul>Compiler Design 40106
    • 35. Introducing Basic Terminology Compiler Design 40106 Token Sample Lexemes Informal Description of Pattern const if relation id num literal const if &lt;, &lt;=, =, &lt; &gt;, &gt;, &gt;= pi, count , D2 3.1416, 0, 6.02E23 “ core dumped” const if &lt; or &lt;= or = or &lt; &gt; or &gt;= or &gt; letter followed by letters and digits any numeric constant any characters between “ and “ except “ Classifies Pattern <ul><li>Actual values are critical. </li></ul><ul><li>Info is : </li></ul><ul><ul><li>1.Stored in symbol table </li></ul></ul><ul><ul><li>2.Returned to parser </li></ul></ul>
    • 36. Attributes for Tokens Tokens influence parsing decision; the attributes influence the translation of tokens. Example: E = M * C ** 2 &lt;id, pointer to symbol-table entry for E&gt; &lt;assign_op, &gt; &lt;id, pointer to symbol-table entry for M&gt; &lt;mult_op, &gt; &lt;id, pointer to symbol-table entry for C&gt; &lt;exp_op, &gt; &lt;num, integer value 2&gt; Compiler Design 40106
    • 37. Role of the Lexical Analyzer Compiler Design 40106
    • 38. <ul><li>Tasks of Lexical Analyzer </li></ul><ul><li>Reads source text and detects the token </li></ul><ul><li>Stripe outs comments, white spaces, tab, newline characters. </li></ul><ul><li>Correlates error messages from compilers to source program </li></ul><ul><li>Approaches to implementation </li></ul><ul><li>. Use assembly language- Most efficient but most difficult to implement </li></ul><ul><li>. Use high level languages like C- Efficient but difficult to implement </li></ul><ul><li>. Use tools like lex, flex- Easy to implement but not as efficient as the first two cases </li></ul>Compiler Design 40106
    • 39. Compiler Design 40106
    • 40. <ul><ul><li>Handling Lexical Errors </li></ul></ul><ul><ul><li>In what Situations do Errors Occur? </li></ul></ul><ul><ul><li>Lexical analyzer is unable to proceed because none of the patterns for tokens matches a prefix of remaining input. </li></ul></ul><ul><ul><li>For example: </li></ul></ul><ul><ul><li>fi ( a == f(x) )…. </li></ul></ul><ul><ul><li>1) Panic mode recovery - deleting successive characters until a well formed token is formed. </li></ul></ul><ul><ul><li>2) Inserting a missing character </li></ul></ul><ul><ul><li>3) Replacing a missing character by a correct character </li></ul></ul><ul><ul><li>4) Transposing two adjacent characters. </li></ul></ul><ul><ul><li>5) Deleting an extraneous character </li></ul></ul>Compiler Design 40106
    • 41. Compiler Design 40106
    • 42. Compiler Design 40106
    • 43. Compiler Design 40106
    • 44. Compiler Design 40106
    • 45. Compiler Design 40106
    • 46. Compiler Design 40106
    • 47. Compiler Design 40106
    • 48. Compiler Design 40106
    • 49. Compiler Design 40106
    • 50. Compiler Design 40106
    • 51. Compiler Design 40106
    • 52. Compiler Design 40106
    • 53. Compiler Design 40106
    • 54. Compiler Design 40106
    • 55. Compiler Design 40106
    • 56. Compiler Design 40106
    • 57. Compiler Design 40106
    • 58. Compiler Design 40106
    • 59. Compiler Design 40106
    • 60. Compiler Design 40106
    • 61. Compiler Design 40106
    • 62. Compiler Design 40106
    • 63. Compiler Design 40106
    • 64. Compiler Design 40106
    • 65. Compiler Design 40106
    • 66. Compiler Design 40106
    • 67. Compiler Design 40106
    • 68. Compiler Design 40106
    • 69. Compiler Design 40106
    • 70. Compiler Design 40106
    • 71. Compiler Design 40106
    • 72. Compiler Design 40106
    • 73. Compiler Design 40106
    • 74. Compiler Design 40106
    • 75. Compiler Design 40106
    • 76. &nbsp;
    • 77. Compiler Design 40106
    • 78. Compiler Design 40106
    • 79. Compiler Design 40106

    ×