1 JavaCUP JavaCUP (Construct Useful Parser) is a parser generator Produce a parser written in java, itself is also written in Java; There are many parser.

Slides:



Advertisements
Similar presentations
JavaCUP JavaCUP (Construct Useful Parser) is a parser generator
Advertisements

Application: Yacc A parser generator A context-free grammar An LR parser Yacc Yacc input file:... definitions... %... production rules... %... user-defined.
CPSC 388 – Compiler Design and Construction
1 Assignment 3 Jianguo Lu. 2 Task: check whether the a program is syntactically correct /** this is a comment line in the sample program **/ INT f2(INT.
COS 320 Compilers David Walker. Outline Last Week –Introduction to ML Today: –Lexical Analysis –Reading: Chapter 2 of Appel.
Abstract Syntax Mooly Sagiv html:// 1.
Bottom-Up Syntax Analysis Mooly Sagiv Textbook:Modern Compiler Design Chapter (modified)
ML-YACC David Walker COS 320. Outline Last Week –Introduction to Lexing, CFGs, and Parsing Today: –More parsing: automatic parser generation via ML-Yacc.
Bottom-Up Syntax Analysis Mooly Sagiv html:// Textbook:Modern Compiler Design Chapter
Context-Free Grammars Lecture 7
Syntax Analysis Mooly Sagiv html:// Textbook:Modern Compiler Implementation in C Chapter 3.
Compiler Construction Parsing Rina Zviel-Girshin and Ohad Shacham School of Computer Science Tel-Aviv University.
Environments and Evaluation
Syntax Analysis Mooly Sagiv html:// Textbook:Modern Compiler Design Chapter 2.2 (Partial) Hashlama 11:00-14:00.
1 Problem 2 A Scanner / Parser for Simple C. 2 Outline l Language syntax for SC l Requirements for the scanner l Requirement for the parser l companion.
Syntax Analysis Mooly Sagiv Textbook:Modern Compiler Design Chapter 2.2 (Partial)
Bottom-Up Syntax Analysis Mooly Sagiv & Greta Yorsh Textbook:Modern Compiler Design Chapter (modified)
Chapter 2 A Simple Compiler
1 AspectJ Assignment. 2 The simple language Tiny program y=2; x=2+y*3; z=x+y*2; –A program is a sequence of assignments; –Expressions on the right hand.
Compiler Construction Parsing I Ran Shaham and Ohad Shacham School of Computer Science Tel-Aviv University.
Parser construction tools: YACC
Compilers: Yacc/7 1 Compiler Structures Objective – –describe yacc (actually bison) – –give simple examples of its use , Semester 1,
Syntax & Semantic Introduction Organization of Language Description Abstract Syntax Formal Syntax The Way of Writing Grammars Formal Semantic.
1 Abstract Syntax Tree--motivation The parse tree –contains too much detail e.g. unnecessary terminals such as parentheses –depends heavily on the structure.
CPSC 388 – Compiler Design and Construction Parsers – Context Free Grammars.
LEX and YACC work as a team
Chapter 1 Introduction Dr. Frank Lee. 1.1 Why Study Compiler? To write more efficient code in a high-level language To provide solid foundation in parsing.
Language Translators - Lee McCluskey LANGUAGE TRANSLATORS: WEEK 21 LECTURE: Using JavaCup to create simple interpreters
Automated Parser Generation (via CUP)CUP 1. High-level structure JFlexjavac Lexer spec Lexical analyzer text tokens.java CUPjavac Parser spec.javaParser.
Lesson 10 CDT301 – Compiler Theory, Spring 2011 Teacher: Linus Källberg.
1 YACC Parser Generator. 2 YACC YACC (Yet Another Compiler Compiler) Produce a parser for a given grammar.  Compile a LALR(1) grammar Original written.
Lab 3: Using ML-Yacc Zhong Zhuang
Interpretation Environments and Evaluation. CS 354 Spring Translation Stages Lexical analysis (scanning) Parsing –Recognizing –Building parse tree.
Syntax Analysis Mooly Sagiv Textbook:Modern Compiler Design Chapter 2.2 (Partial) 1.
CPS 506 Comparative Programming Languages Syntax Specification.
1 Chapter 3 Syntax, Errors, and Debugging Fundamentals of Java: AP Computer Science Essentials, 4th Edition Lambert / Osborne.
Introduction Lecture 1 Wed, Jan 12, The Stages of Compilation Lexical analysis. Syntactic analysis. Semantic analysis. Intermediate code generation.
Chapter 3 Syntax, Errors, and Debugging Fundamentals of Java.
1 Lex & Yacc. 2 Compilation Process Lexical Analyzer Source Code Syntax Analyzer Symbol Table Intermed. Code Gen. Code Generator Machine Code.
1 Parsers and Grammar. 2 Categories of Grammar Rules  Declarations or definitions. AttributeDeclaration ::= [ final ] [ static ] [ access ] datatype.
YACC. Introduction What is YACC ? a tool for automatically generating a parser given a grammar written in a yacc specification (.y file) YACC (Yet Another.
CS 614: Theory and Construction of Compilers Lecture 9 Fall 2002 Department of Computer Science University of Alabama Joel Jones.
Compiler Principles Fall Compiler Principles Lecture 6: Parsing part 5 Roman Manevich Ben-Gurion University.
CS 614: Theory and Construction of Compilers Lecture 7 Fall 2003 Department of Computer Science University of Alabama Joel Jones.
1 JavaCUP JavaCup (Construct Useful Parser) is a parser generator; Produce a parser written in java, itself is also written in Java; There are many parser.
Parser Generation Using SLK and Flex++ Copyright © 2015 Curt Hill.
PL&C Lab, DongGuk University Compiler Lecture Note, MiscellaneousPage 1 Yet Another Compiler-Compiler Stephen C. Johnson July 31, 1978 YACC.
Compiler Principles Fall Compiler Principles Lecture 5: Parsing part 4 Roman Manevich Ben-Gurion University.
LECTURE 11 Semantic Analysis and Yacc. REVIEW OF LAST LECTURE In the last lecture, we introduced the basic idea behind semantic analysis. Instead of merely.
Syntax Analysis (chapter 4) SLR, LR1, LALR: Improving the parser From the previous examples: => LR0 parsing is rather weak. Cannot handle many languages.
More yacc. What is yacc – Tool to produce a parser given a grammar – YACC (Yet Another Compiler Compiler) is a program designed to compile a LALR(1) grammar.
YACC (Yet Another Compiler-Compiler) Chung-Ju Wu
Compiler Construction Sohail Aslam Lecture Parser Generators  YACC – Yet Another Compiler Compiler appeared in 1975 as a Unix application.  The.
1 Assignment 2: AspectJ. 2 The simple language Tiny program y=2; x=2+y*3; z=x+y*2; –A program is a sequence of assignments; –Expressions on the right.
CS 3304 Comparative Languages
Chapter 3 – Describing Syntax
JavaCUP JavaCUP (Construct Useful Parser) is a parser generator
CUP: An LALR Parser Generator for Java
Tutorial On Lex & Yacc.
Textbook:Modern Compiler Design
Java CUP.
CMPE 152: Compiler Design April 5 Class Meeting
Fall Compiler Principles Lecture 4: Parsing part 3
CPSC 388 – Compiler Design and Construction
CPSC 388 – Compiler Design and Construction
Parsing & Scanning Lecture 2
CS 3304 Comparative Languages
Syntax-Directed Translation
CS 3304 Comparative Languages
Fall Compiler Principles Lecture 4: Parsing part 3
Presentation transcript:

1 JavaCUP JavaCUP (Construct Useful Parser) is a parser generator Produce a parser written in java, itself is also written in Java; There are many parser generators. –YACC (Yet Another Compiler-Compiler) for C programming language (dragon book chapter 4.9); There are also many parser generators written in Java –JavaCC; –ANTLR;

2 More on classification of java parser generators Bottom up Parser Generators Tools –JavaCUP; –SableCC, The Sable Compiler Compiler Topdown Parser Generators Tools –ANTLR, Another Tool for Language Recognition –JavaCC, Java Compiler Compiler

3 What is a parser generator Total:=price+tax; Scanner Parser id Exp + id Expr assignment := id Total:=price+tax; Parser generator (JavaCup) Context Free Grammar

4 Steps to use JavaCup Write a javaCup specification (cup file) –Defines the grammar and actions in a file (say, calc.cup) Run javaCup to generate a parser –java java_cup.Main calc.cup –Notice the package prefix java_cup before Main; –Will generate parser.java and sym.java (default class names, which can be changed) Write your program that uses the parser –For example, UseParser.java Compile and run your program

5 Example 1: parse an expression and evaluate it Grammar for arithmetic expression expr  expr ‘+’ expr | expr ‘–’ expr | expr ‘*’ expr | expr ‘/’expr | ‘(‘expr’)’ | number Example (2+4)*3 is an expression Our tasks: –Tell whether an expression like “(2+4)*3” is syntactically correct; –Evaluate the expression (we are actually producing an interpreter for the “expression language”).

6 The overall picture JLex CalcScanner javaCup CalcParser calc.lexcalc.cup expression (2+4)*3 tokens SymbolScanner CalcScanner CalcParser lr_parser implementsextends java_cup.runtime result CalcParserUser public interface Scanner { public Symbol next_token() throws java.lang.Exception; }

7 Calculator javaCup specification (calc.cup) terminal PLUS, MINUS, TIMES, DIVIDE, LPAREN, RPAREN; terminal Integer NUMBER; non terminal Integer expr; precedence left PLUS, MINUS; precedence left TIMES, DIVIDE; expr ::= expr PLUS expr | expr MINUS expr | expr TIMES expr | expr DIVIDE expr | LPAREN expr RPAREN | NUMBER ; Is the grammar ambiguous? Add precedence and associativity –left means, that a + b + c is parsed as (a + b) + c –lowest precedence comes first, so a + b * c is parsed as a + (b * c) How can we get PLUS, NUMBER,...? –They are the terminals returned by the scanner. How to connect with the scanner?

8 Ambiguous grammar error If we enter the grammar as below: Expression ::= Expression PLUS Expression; Without precedence JavaCUP will tell us: Shift/Reduce conflict found in state #4 between Expression ::= Expression PLUS Expression () and Expression ::= Expression () PLUS Expression under symbol PLUS Resolved in favor of shifting. The grammar is ambiguous! Telling JavaCUP that PLUS is left associative helps.

9 Corresponding scanner specification (calc.lex) 1.import java_cup.runtime.Symbol; 2.Import java_cup.runtime.Scanner; 3.% 4.%implements java_cup.runtime.Scanner 5.%type Symbol 6.%function next_token 7.%class CalcScanner 8.%eofval{ return null; 9.%eofval} 10.NUMBER = [0-9]+ 11.% 12."+" { return new Symbol(CalcSymbol.PLUS); } 13."-" { return new Symbol(CalcSymbol.MINUS); } 14."*" { return new Symbol(CalcSymbol.TIMES); } 15."/" { return new Symbol(CalcSymbol.DIVIDE); } 16.{NUMBER} { return new Symbol(CalcSymbol.NUMBER, new Integer(yytext()));} 17.\r|\n|. {} Connection with the parser –imports java_cup.runtime.*, Symbol, Scanner. –implements Scanner –next_token: defined in Scanner interface –CalcSymbol, PLUS, MINUS,... –new Integer(yytext())

10 Run JLex D:\214>java JLex.Main calc.lex –note the package prefix JLex –program text generated: calc.lex.java D:\214>javac calc.lex.java –classes generated: CalcScanner.class

11 Generated CalcScanner class 1.import java_cup.runtime.Symbol; 2.Import java_cup.runtime.Scanner; 3.class CalcScanner implements java_cup.runtime.Scanner { public Symbol next_token () { case 3: { return new Symbol(CalcSymbol.MINUS); } 8. case 6: { return new Symbol(CalcSymbol.NUMBER, new Integer(yytext()));} } 11. } Interface Scanner is defined in java_cup.runtime package public interface Scanner { public Symbol next_token() throws java.lang.Exception; }

12 Run javaCup Run javaCup to generate the parser –D:\214>java java_cup.Main -parser CalcParser -symbols CalcSymbol calc.cup –classes generated: CalcParser; CalcSymbol; Compile the parser and relevant classes –D:\214>javac CalcParser.java CalcSymbol.java CalcParserUser.java Use the parser –D:\214>java CalcParserUser

13 The token class Symbol.java 1. public class Symbol { 2. public int sym, left, right; 3. public Object value; 4. public Symbol(int id, int l, int r, Object o) { 5. this(id); left = l; right = r; value = o; 6. } 7. public Symbol(int id, Object o) { this(id, -1, -1, o); } 8. public Symbol(int sym_num) {.. } 9. public String toString() { return "#"+sym; } 10. } Instance variables: –sym: the symbol type; –left: left position in the original input file; –right: right position in the original input file; –value: the lexical value. Recall the action in lex file: [0-9]+ {return new Symbol(CalcSymbol.NUMBER,new Integer(yytext()));} "+" { return new Symbol(CalcSymbol.PLUS); }

14 CalcSymbol.java (default name is sym.java) 1.public class CalcSymbol { 2. public static final int MINUS = 3; 3. public static final int DIVIDE = 5; 4. public static final int NUMBER = 8; 5. public static final int EOF = 0; 6. public static final int PLUS = 2; 7. public static final int error = 1; 8. public static final int RPAREN = 7; 9. public static final int TIMES = 4; 10. public static final int LPAREN = 6; 11.} Contain token declaration, one for each token (terminal); Generated from the terminal list in cup file –terminal PLUS, MINUS, TIMES, DIVIDE, LPAREN, RPAREN; –terminal Integer NUMBER Used by scanner to refer to symbol types, e.g., –return new Symbol(CalcSymbol.PLUS); Class name comes from –symbols directive. java java_cup.Main -parser CalcParser -symbols CalcSymbol calc.cup

15 The program that uses the CalcPaser 1.import java.io.*; 2.class CalcParserUser { 3. public static void main(String[] args) throws IOException{ 4. File inputFile = new File ("d:/214/calc.input"); 5. CalcParser parser= new CalcParser 6. (new CalcScanner(new FileInputStream(inputFile))); 7. parser.parse(); 8. } 9.} The input text to be parsed can be any input stream (in this example it is a FileInputStream); The first step is to construct a parser object. A parser can be constructed using a scanner. –this is how scanner and parser get connected. If there is no error report, the expression in the input file is correct.

16 Recap To write a parser, how many things you need to write? –cup file; –lex file; –a program to use the parser; To run a parser, how many things you need to do? –Run javaCup, to generate the parser; –Run JLex, to generate the scanner; –Compile the scanner, the parser, the relevant classes, and the class using the parser; relevant classes: CalcSymbol, Symbol –Run the class that uses the parser.

17 Recap (cont.) JLex CalcScanner javaCup CalcParser calc.lexcalc.cup expression 2+(3*5) tokens SymbolScanner lr_parser implementsextends java_cup.runtime result CalcParserUser coded as CalcSymbol generate use

18 Evaluate the expression The previous specification only indicates the success or failure of a parser. No semantic action is associated with grammar rules. To calculate the expression, we must add java code in the grammar to carry out actions at various points. Form of the semantic action: expr:e1 PLUS expr:e2 {: RESULT=new Integer(e1.intValue()+ e2.intValue()); :} –Actions (java code) are enclosed within a pair {: :}. Note that it is different from JLex action code bracket –Labels e1, e2: the objects that represent the corresponding terminal or non- terminal; –RESULT: The type of RESULT should be the same as the type of the corresponding non-terminals. e.g., expr is of type Integer, so RESULT is of type integer. –In the cup file, you need to specify expr is of Integer type. non terminal Integer expr;

19 Change the calc.cup 1.terminal PLUS, MINUS, TIMES, DIVIDE, LPAREN, RPAREN; 2.terminal Integer NUMBER; 3.non terminal Integer expr; 4.precedence left PLUS, MINUS; 5.precedence left TIMES, DIVIDE; 6.expr::= expr:e1 PLUS expr:e2 {: 7. RESULT = new Integer(e1.intValue()+ e2.intValue()); :} 8.| expr:e1 MINUS expr:e2 {: 9. RESULT = new Integer(e1.intValue()- e2.intValue()); :} 10.| expr:e1 TIMES expr:e2 {: 11. RESULT = new Integer(e1.intValue()* e2.intValue()); :} 12.| expr:e1 DIVIDE expr:e2 {: 13. RESULT = new Integer(e1.intValue()/ e2.intValue()); :} 14.| LPAREN expr:e RPAREN {: RESULT = e; :} 15.| NUMBER:e {: RESULT= e; :} How do you guarantee NUMBER is of Integer type? Yytext() returns a String {NUMBER} { return new Symbol(CalcSymbol.NUMBER, new Integer(yytext()));}

20 Change CalcPaserUser 1.import java.io.*; 2.class CalcParserUser { 3. public static void main(String[] a) throws Exception{ 4. CalcParser parser= new CalcParser( 5. new CalcScanner(new FileReader(“calc.input”))); 6. Integer result= (Integer)parser.parse().value; 7. System.out.println("result is "+ result); 8. } 9.} Why the result of parser().value can be casted into an Integer? Can we cast that into other types? –This is determined by the type of expr, which is the head of the first production in javaCup specification: non terminal Integer expr;

21 Calc: second round Calc program syntax program  statement | statement program statement  assignment SEMI assignment  ID EQUAL expr expr  expr PLUS expr | expr MULTI expr | LPAREN expr RPAREN | NUMBER | ID Example program: X=1; y=2; z=x+y*2; Task: generate and display the parse tree in XML

22 Abstract syntax tree Program Statement Assignment IDExprIDExprIDExpr PLUSExpr IDMULTIExpr IDNUMBER X=1; y=2; z=x+y*2;

23 OO Design Rationale Write a class for every non-terminal –Program, Statement, Assignment, Expr Write an abstract class for non-terminal which has alternatives –Given a rule: statement  assignment | ifStatement –Statement should be an abstract class; –Assignment should extends Statement; Semantic part of the CUP file will construct the object; –assignment ::= ID:e1 EQUAL expr:e2 {: RESULT = new Assignment(e1, e2); :} The first rule will return the top level object (the Program object) –the result of parsing is a Program object It is similar to XML DOM parser.

24 Calc2.cup 1.terminal String ID, LPAREN, RPAREN, EQUAL, SEMI, PLUS, MULTI; 2.terminal Integer NUMBER; 3.non terminal Expr expr; 4.non terminal Statement statement; 5.non terminal Program program; 6.non terminal Assignment assignment; 7.precedence left PLUS; 8.precedence left MULTI; 9.program ::= statement:e {: RESULT = new Program(e); :} 10. | statement:e1 program:e2 {: RESULT=new Program(e1, e2); :}; 11.statement ::= assignment:e SEMI {: RESULT = e; :} ; 12.assignment::= ID:e1 EQUAL expr:e2 13. {: RESULT = new Assignment(e1, e2); :}; 14.expr ::= expr:e1 PLUS:e expr:e2 {: RESULT=new Expr(e1,e2,e); :} 15. | expr:e1 MULTI:e expr:e2 {: RESULT=new Expr(e1,e2,e); :} 16. | LPAREN expr:e RPAREN {: RESULT = e; :} 17. | NUMBER:e {: RESULT= new Expr(e); :} 18. | ID:e {: RESULT = new Expr(e); :} 19.; Common bugs in assignments: ; {: :}

25 Program class 1.import java.util.*; 2.public class Program { 3.private Vector statements; 4.public Program(Statement s) { 5. statements = new Vector(); 6. statements.add(s); 7.} 8.public Program(Statement s, Program p) { 9.statements = p.getStatements(); 10.statements.add(s); 11.} 12.public Vector getStatements(){ return statements; } 13.public String toXML() {......} 14.} Program ::= statement:e {: RESULT=new Program(e); :} | statement:e1 program:e2 {: RESULT=new Program(e1, e2); :}

26 Assignment statement class 1.class Assignment extends Statement{ 2.private String lhs; 3.private Expr rhs; 4.public Assignment(String l, Expr r){ 5.lhs=l; 6.rhs=r; 7.} 8.String toXML(){ 9.String result=" "; 10.result += " " + lhs + " "; 11.result += rhs.toXML(); 12.result += " "; 13.return result; 14.} 15.} assignment::=ID:e1 EQUAL expr:e2 {: RESULT = new Assignment(e1, e2); :}

27 Expr class 1.public class Expr { 2. private int value; 3. private String id; 4. private Expr left; 5. private Expr right; 6. private String op; 7. public Expr(Expr l, Expr r, String o){ left=l; right=r; op=o; } 8. public Expr(Integer i){ value=i.intValue();} 9. public Expr(String i){ id=i;} 10. public String toXML() {... } 11.} expr::= expr:e1 PLUS:e expr:e2 {: RESULT = new Expr(e1, e2, e); :} | expr:e1 MULTI:e expr:e2 {: RESULT = new Expr(e1, e2, e);:} | LPAREN expr:e RPAREN {: RESULT = e; :} | NUMBER:e {: RESULT= new Expr(e); :} | ID:e {: RESULT = new Expr(e); :}

28 Calc2.lex 1.import java_cup.runtime.*; 2.% 3.%implements java_cup.runtime.Scanner 4.%type Symbol 5.%function next_token 6.%class Calc2Scanner 7.%eofval{ return null; 8.%eofval} 9.IDENTIFIER = [a-zA-Z][a-zA-Z0-9_]* 10.NUMBER = [0-9]+ 11.% 12."+" { return new Symbol(Calc2Symbol.PLUS, yytext()); } 13."*" { return new Symbol(Calc2Symbol.MULTI, yytext()); } 14."=" { return new Symbol(Calc2Symbol.EQUAL, yytext()); } 15.";" { return new Symbol(Calc2Symbol.SEMI, yytext()); } 16."(" { return new Symbol(Calc2Symbol.LPAREN, yytext()); } 17.")" { return new Symbol(Calc2Symbol.RPAREN, yytext()); } 18.{IDENTIFIER} {return new Symbol(Calc2Symbol.ID, yytext()); } 19.{NUMBER} { return new Symbol(Calc2Symbol.NUMBER, new Integer(yytext()));} 20.\n|\r|. { }

29 Calc2Parser User 1.class ProgramProcessor { 2.public static void main(String[] args) throws IOException{ 3. File inputFile = new File ("d:/214/calc2.input"); 4. Calc2Parser parser= new Calc2Parser( 5. new Calc2Scanner(new FileInputStream(inputFile))); 6. Program pm= (Program)parser.debug_parse().value; 7. String xml=pm.toXML(); 8. System.out.println("result is "+ xml); 9.} 10.} Debug_parser(): print out debug info, such as the current token being processed, the rule being applied. –Useful to debug javacup specification. Parsing result value is of Program type—this is decided by the type of the program rule: Program ::= statement:e {: RESULT = new Program(e); :} | statement:e1 program:e2 {: RESULT=new Program(e1, e2); :} ;

30 Another way to define the expression syntax terminal PLUS, MINUS, TIMES, DIV, LPAREN, RPAREN; terminal NUMLIT; non terminal Expression, Term, Factor; start with Expression; Expression ::= Expression PLUS Term | Expression MINUS Term | Term ; Term ::= Term TIMES Factor | Term DIV Factor | Factor ; Factor ::= NUMLIT | LPAREN Expression RPAREN ;

31 Debug the grammar import java.io.*; class A3User { public static void main(String[] args) throws Exception { File inputFile = new File ("A3.tiny"); A3Parser parser= new A3Parser(new A3Scanner(new FileInputStream(inputFile))); Integer result =(Integer)parser.debug_parse().value; FileWriter fw=new FileWriter(new File("A3.output")); fw.write("Number of methods: "+ result.intValue()); fw.close(); } } Parser will print out processed symbols and the current symbol that is causing the problem

32 Run all the programs using one command Save the following into a file: java JLex.Main A3.lex java java_cup.Main -parser A3Parser -symbols A3Symbol < A3.cup javac A3.lex.java A3Parser.java A3Symbol.java A3User.java java A3User Under unix –Can be any file name. say run214 –Type: “chmod 755 run214” –Type “run214” Under windows –Save as “run214.bat” –Type “run214” It is script programming

33 More flexible Script program (say named run214) java JLex.Main $1.lex mv $1.lex.java $1Scanner.java java java_cup.Main -parser $1Parser -symbols $1Symbol A3Lu.cup javac $1Scanner.java A3Parser.java A3Symbol.java A3User.java java $1User more $1.output Run the scrip program with parameter > run214 A3