COLLEGE OF ENGINEERING, NASHIK. LANGUAGE TRANSLATOR

Size: px

Start display at page:

Download "COLLEGE OF ENGINEERING, NASHIK. LANGUAGE TRANSLATOR"

Victoria Walsh
5 years ago
Views:

1 Pune Vidyarthi Griha s COLLEGE OF ENGINEERING, NASHIK. LANGUAGE TRANSLATOR By Prof. Anand N. Gharu (Assistant Professor) PVGCOE Computer Dept.. 22nd Jan 2018

2 CONTENTS :- 1. Role of lexical analysis 2. Parsing, token, pattern, lexemes lex. Error 3. Regular def. for language construct & string 4. Sequences, comments & transition diagram for recognition of tokens, reserved word & ident. 5. Introduction to Compiler & Interpreters 6. General model of Compiler 7. Compare compiler and interpreter 8. Use of interpreter & component of interpreter 9. Overview of Lex & YACC Specifications.

3 What s a compiler? All computers only understand machine language This is a program Therefore, high-level language instructions must be translated into machine language prior to execution 3

4 What s a compiler? Compiler A piece of system software that translates high-level languages into machine language while (c!='x') { if (c == 'a' c == 'e' c == 'i') else printf("congrats!"); program.c if (c!='x') printf("you Loser!"); Congrats! } Compiler prog gcc -o prog program.c 4

5 Compiler Complier:- These are the system programs which will automatically translate the High level language program in to the machine language program Source program High level Lang. Prog. Compiler Target program / M/C Lang. Prog. Database

6 Types of Compiler Cross Assembler:- These are the system programs which will automatically translate the Assembly Language program compatible with M/C A, in to the machine language program compatible with M/C A Source program Assembly Lang. Prog. Compatible with M/C A Cross Assembler Target program / M/C Lang. Prog. Compatible with M/C A M/C B

7 Types of compiler Cross Compiler:- These are the system programs which will automatically translate the HLL program compatible with M/C A, in to the machine language program compatible with M/C A, but the underlying M/C is M/C B Source program HLL Prog. Compatible with M/C A Cross Compiler Target program / M/C Lang. Prog. M/C B

8 Types of Compiler

10 Interpreter - It is the language translator which execute source program line by line with out translating them into machine language. - It does not generate object code.

11 Compiler vs Interpreter, C++, Visual Basic

12 Phases of compiler

13 Structure of Compiler Any compiler must perform two major tasks Compiler o o Analysis Analysis of the source program Synthesis of a machine-language program Synthesis 13

14 Structure of Compiler (Character Stream) Source Program Scanner Tokens Parser Syntactic Semantic Structure Routines Intermediate Representation Symbol and Attribute Tables (Used by all Phases of The Compiler) Optimizer Code Generator 14 Target machine code

Structure of Compiler (Character Stream) Source Program Scanner Tokens Parser Scanner

scanner begins the analysis of the source program by reading the input, Symbol character and

Tables (Used by all RE ( Regular expression ) Phases of NFA ( Non-deterministic Finite

15 Structure of Compiler (Character Stream) Source Program Scanner Tokens Parser Scanner (Lexical Analysis) Syntactic Structure Semantic Routines Intermediate Representation The scanner begins the analysis of the source program by reading the input, Symbol character and by character, and grouping characters into Attribute individual words and symbols (tokens) Tables (Used by all RE ( Regular expression ) Phases of NFA ( Non-deterministic Finite Automata ) The Compiler) DFA ( Deterministic Finite Automata ) LEX Optimizer Code Generator 15 Target machine code

Structure of Compiler (Character Stream) Source Program Scanner Tokens Parser Parser (Syntax Analysis) Syntactic Semantic Structure Routines Intermediate Representation Given a formal syntax

16 Structure of Compiler (Character Stream) Source Program Scanner Tokens Parser Parser (Syntax Analysis) Syntactic Semantic Structure Routines Intermediate Representation Given a formal syntax specification (typically as a context-free grammar Symbol [CFG] and ), the parse reads tokens and groups them into Attribute units as specified by the productions of the CFG being used. Tables As syntactic structure is recognized, the parser either calls corresponding semantic (Used by routines all directly or builds a syntax tree. Phases of CFG ( Context-Free Grammar ) The Compiler) BNF ( Backus-Naur Form ) GAA ( Grammar Analysis Algorithms ) Optimizer Code Generator 16 Target machine code

Structure of Compiler (Character Stream) Source Program Scanner Tokens Semantic Routines Parser Syntactic Semantic Structure Routines Intermediate Representation Perform two functions Symbol and

17 Structure of Compiler (Character Stream) Source Program Scanner Tokens Semantic Routines Parser Syntactic Semantic Structure Routines Intermediate Representation Perform two functions Symbol and Check the static semantics of each construct Attribute Do the actual translation Tables The heart of a compiler (Used by all Syntax Directed Translation Phases of Semantic Processing Techniques IR (Intermediate Representation) The Compiler) Optimizer Code Generator 17 Target machine code

Structure of Compiler (Character Stream) Source Program Scanner Tokens Parser Syntactic Semantic Structure Routines Intermediate Optimizer Representation The IR code generated by the semantic

18 Structure of Compiler (Character Stream) Source Program Scanner Tokens Parser Syntactic Semantic Structure Routines Intermediate Optimizer Representation The IR code generated by the semantic routines is analyzed and transformed Symbol into and functionally equivalent but improved IR code Attribute This phase can be very Tables complex and slow Peephole optimization (Used by all loop optimization, register Phases allocation, of code scheduling The Compiler) Register and Temporary Management Peephole Optimization Optimizer Code Generator 18 Target machine code

Grammar-Based Code Generator Tokens Parser Syntactic Semantic Structure

19 Structure of Compiler (Character Stream) Source Program Scanner Code Generator Interpretive Code Generation Generating Code from Tree/Dag Grammar-Based Code Generator Tokens Parser Syntactic Semantic Structure Routines Intermediate Representation Optimizer Code Generator Target machine code 19

20 Structure of Compiler Code Generator [Intermediate Code Generator] Scanner [Lexical Analyzer] Non-optimized Intermediate Code Tokens Parser [Syntax Analyzer] Code Optimizer Optimized Intermediate Code Parse tree Code Optimizer Semantic Process [Semantic analyzer] Target machine code Abstract Syntax Tree w/ Attributes 20

21 Lexical Analysis

22 Syntax Analysis

23 Semantic Analysis

24 Intermediate Code Generation

31 Code Optimization

32 Code Generation

42 Code Optimization

52 Structure of Compiler Compiler writing tools Compiler generators or compilercompilers oe.g. scanner and parser generators oexamples : Yacc, Lex 52

53 Overview of Lex & YAAC Lex: Theory. Execution. Example. Yacc: Theory. Description. Example. Lex & Yacc linking. Demo. 53

54 Lex lex is a program (generator) that generates lexical analyzers, (widely used on Unix). It is mostly used with Yacc parser generator. Written by Eric Schmidt and Mike Lesk. It reads the input stream (specifying the lexical analyzer ) and outputs source code implementing the lexical analyzer in the C programming language. Lex will read patterns (regular expressions); then produces C code for a lexical analyzer that scans for identifiers. 54

55 STRUCTURE OF LEX

56 Lex A simple pattern: letter(letter digit)* Regular expressions are translated by lex to a computer program that mimics an FSA. This pattern matches a string of characters that begins with a single letter followed by zero or more letters or digits. 56

57 Lex Some limitations, Lex cannot be used to recognize nested structures such as parentheses, since it only has states and transitions between states. So, Lex is good at pattern matching, while Yacc is for more challenging tasks. 57

58 Lex Pattern Matching Primitives 58

59 Lex Pattern Matching examples. 59

60 Lex..Definitions section %% Rules section.. %%.C code section (subroutines).. The input structure to Lex. Echo is an action and predefined macro in lex that writes code matched by the pattern. 60

61 Lex Lex predefined variables. 61

62 Lex Whitespace must separate the defining term and the associated expression. Code in the definitions section is simply copied as-is to the top of the generated C file and must be bracketed with %{ and %} markers. substitutions in the rules section are surrounded by braces ({letter}) to distinguish them from literals. 62

63 Yacc Theory: Yacc reads the grammar and generate C code for a parser. Grammars written in Backus Naur Form (BNF). BNF grammar used to express context-free languages. e.g. to parse an expression, do reverse operation( reducing the expression) This known as bottom-up or shift-reduce parsing. Using stack for storing (LIFO). 63

64 STRUCTURE OF YACC

65 Yacc Input to yacc is divided into three sections.... definitions... %%... rules... %%... subroutines... 65

66 Yacc The definitions section consists of: token declarations. C code bracketed by %{ and %}. the rules section consists of: BNF grammar. the subroutines section consists of: user subroutines. 66

67 yacc& lex in Together The grammar: program -> program expr ε expr -> expr + expr expr - expr id Program and expr are nonterminals. Id are terminals (tokens returned by lex). expression may be : o sum of two expressions. o product of two expressions. o Or an identifiers 67

68 Lex file 68

69 Yacc file 69

70 Linking lex&yacc 70

71 Thank You 1/22/

CST-402(T): Language Processors

CST-402(T): Language Processors Course Outcomes: On successful completion of the course, students will be able to: 1. Exhibit role of various phases of compilation, with understanding of types of grammars