Analysis of the source program
Download as PPT, PDF9 likes14,946 views
The document discusses the three phases of analysis in compiling a source program: 1) Linear analysis involves grouping characters into tokens with collective meanings like identifiers and operators. 2) Hierarchical analysis groups tokens into nested structures with collective meanings like expressions, represented by parse trees. 3) Semantic analysis checks that program components fit together meaningfully through type checking and ensuring operators have permitted operand types.
![Ref: Compilers Principles, Techniques and Tools by Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman Tayyab Arif Allama Iqbal Open University [email_address] [email_address]](https://image.slidesharecdn.com/analysisofthesourceprogram-100606125324-phpapp02/85/Analysis-of-the-source-program-21-320.jpg)
Analysis of the source program
- 1. Analysis of the Source Program: In compiling, analysis consists of three phases: Linear Analysis : Hierarchical Analysis: Semantic Analysis:
- 2. Analysis of the Source Program: Linear Analysis : In which the stream of characters making up the source program is read from left-to-right and grouped into tokens that are sequences of characters having a collective meaning.
- 3. Analysis of the Source Program: Hierarchical Analysis : In which characters or tokens are grouped hierarchically into nested collections with collective meaning.
- 4. Analysis of the Source Program: Semantic Analysis : In which certain checks are performed to ensure that the components of a program fit together meaningfully.
- 6. Scanning or Lexical Analysis (Linear Analysis): In a compiler, linear analysis is called lexical analysis or scanning. For example, in lexical analysis the characters in the assignment statement Position: = initial + rate * 60 Would be grouped into the following tokens:
- 7. Scanning or Lexical Analysis (Linear Analysis): The identifier, position. The assignment symbol := The identifier initial. The plus sign. The identifier rate. The multiplication sign. The number 60.
- 8. Scanning or Lexical Analysis (Linear Analysis): The blanks separating the characters of these tokens would normally be eliminated during the lexical analysis.
- 10. Syntax Analysis or Hierarchical Analysis (Parsing): Hierarchical analysis is called parsing or syntax analysis. It involves grouping the tokens of the source program into grammatical phases that are used by the compiler to synthesize output.
- 11. Syntax Analysis or Hierarchical Analysis (Parsing): The grammatical phrases of the source program are represented by a parse tree.
- 12. Syntax Analysis or Hierarchical Analysis (Parsing): In the expression initial + rate * 60 , the phrase rate * 60 is a logical unit because the usual conventions of arithmetic expressions tell us that the multiplication is performed before addition. Because the expression initial + rate is followed by a *, it is not grouped into a single phrase by itself
- 13. Syntax Analysis or Hierarchical Analysis (Parsing): The hierarchical structure of a program is usually expressed by recursive rules. For example, we might have the following rules, as part of the definition of expression:
- 14. Syntax Analysis or Hierarchical Analysis (Parsing): Any identifier is an expression. Any number is an expression If expression 1 and expression 2 are expressions, then so are Expression 1 + expression 2 Expression 1 * expression 2 (Expression 1 )
- 16. Semantic Analysis : The semantic analysis phase checks the source program for semantic errors and gathers type information for the subsequent code-generation phase.
- 17. Semantic Analysis : It uses the hierarchical structure determined by the syntax-analysis phase to identify the operators and operand of expressions and statements.
- 18. Semantic Analysis : An important component of semantic analysis is type checking. Here are the compiler checks that each operator has operands that are permitted by the source language specification.
- 19. Semantic Analysis : For example, when a binary arithmetic operator is applied to an integer and real. In this case, the compiler may need to be converting the integer to a real. As shown in figure given below
- 21. Ref: Compilers Principles, Techniques and Tools by Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman Tayyab Arif Allama Iqbal Open University [email_address] [email_address]