50/50 rule You need to get 50% from tests, AND

Slides:



Advertisements
Similar presentations
Compiler construction in4020 – lecture 4 Koen Langendoen Delft University of Technology The Netherlands.
Advertisements

Compilation (Semester A, 2013/14) Lecture 6a: Syntax (Bottom–up parsing) Noam Rinetzky 1 Slides credit: Roman Manevich, Mooly Sagiv, Eran Yahav.
Mooly Sagiv and Roman Manevich School of Computer Science
Bhaskar Bagchi (11CS10058) Lecture Slides( 9 th Sept. 2013)
1 Chapter 5: Bottom-Up Parsing (Shift-Reduce). 2 - attempts to construct a parse tree for an input string beginning at the leaves (the bottom) and working.
Bottom-Up Syntax Analysis Mooly Sagiv Textbook:Modern Compiler Design Chapter (modified)
Bottom-Up Syntax Analysis Mooly Sagiv html:// Textbook:Modern Compiler Design Chapter
Bottom-Up Syntax Analysis Mooly Sagiv & Greta Yorsh Textbook:Modern Compiler Design Chapter (modified)
Bottom Up Parsing.
Bottom-Up Syntax Analysis Mooly Sagiv & Greta Yorsh Textbook:Modern Compiler Design Chapter (modified)
Bottom-Up Syntax Analysis Mooly Sagiv html:// Textbook:Modern Compiler Implementation in C Chapter 3.
Table-driven parsing Parsing performed by a finite state machine. Parsing algorithm is language-independent. FSM driven by table (s) generated automatically.
MATLAB objects using nested functions MathWorks Compiler Course – Day 2.
Compiler Construction Parsing I Ran Shaham and Ohad Shacham School of Computer Science Tel-Aviv University.
1 214 review. 2 What we have learnt Generate scanner and parser –We do not program directly –Instead we write the specifications for the scanner and parser.
Parsing G Programming Languages May 24, 2012 New York University Chanseok Oh
Concordia University Department of Computer Science and Software Engineering Click to edit Master title style COMPILER DESIGN Review Joey Paquet,
Joey Paquet, Lecture 12 Review. Joey Paquet, Course Review Compiler architecture –Lexical analysis, syntactic analysis, semantic.
CS 153 A little bit about LR Parsing. Background We’ve seen three ways to write parsers:  By hand, typically recursive descent  Using parsing combinators.
Exam 1 Review EECS 483 – Lecture 15 University of Michigan Monday, October 30, 2006.
Chapter 5: Bottom-Up Parsing (Shift-Reduce)
Prof. Necula CS 164 Lecture 8-91 Bottom-Up Parsing LR Parsing. Parser Generators. Lecture 6.
–Exercise: construct the SLR parsing table for grammar: S->L=R, S->R L->*R L->id R->L –The grammar can have shift/reduce conflict or reduce/reduce conflict.
Compiler Introduction 1 Kavita Patel. Outlines 2  1.1 What Do Compilers Do?  1.2 The Structure of a Compiler  1.3 Compilation Process  1.4 Phases.
COMP 3438 – Part II-Lecture 5 Syntax Analysis II Dr. Zili Shao Department of Computing The Hong Kong Polytechnic Univ.
Bernd Fischer RW713: Compiler and Software Language Engineering.
CS412/413 Introduction to Compilers and Translators Spring ’99 Lecture 6: LR grammars and automatic parser generators.
CH4.1 CSE244 Midterm Subjects Aggelos Kiayias Computer Science & Engineering Department The University of Connecticut 371 Fairfield Road, Box U-155 Storrs,
Mid-Terms Exam Scope and Introduction. Format Grades: 100 points -> 20% in the final grade Multiple Choice Questions –8 questions, 7 points each Short.
Exam 1 Review (With answers) EECS 483 – Lecture 15 University of Michigan Monday, October 30, 2006.
Review 1.Structure of the course Lexical Analysis Syntax Analysis Grammar & Language RG & DFA Top-down LL(1) Parsing Bottom-Up LR Layered Automation Semantic.
CS 404Ahmed Ezzat 1 CS 404 Introduction to Compiler Design Lecture Ahmed Ezzat.
2016/7/9Page 1 Lecture 11: Semester Review COMP3100 Dept. Computer Science and Technology United International College.
Changes to JFLAP to Increase Its Use in Courses Susan H. Rodger Duke University ITiCSE 2011 Darmstadt, Germany June 29, 2011 NSF Grants.
5. Context-Free Grammars and Languages
CS 326 Programming Languages, Concepts and Implementation
Programming Languages Translator
LR Parsing – The Items Lecture 10 Fri, Feb 13, 2004.
Lexical and Syntax Analysis
Chapter 2 :: Programming Language Syntax
Chapter 2 :: Programming Language Syntax
Table-driven parsing Parsing performed by a finite state machine.
CSCE 355 Foundations of Computation
Compiler Lecture 1 CS510.
Bottom-Up Syntax Analysis
CS 3304 Comparative Languages
CPSC 388 – Compiler Design and Construction
LR(1) grammars The Chinese University of Hong Kong Fall 2010
An Interactive Approach to Formal Languages and Automata with JFLAP
MathWorks Compiler Course – Day 3
Lecture (From slides by G. Necula & R. Bodik)
Compilers Principles, Techniques, & Tools Taught by Jing Zhang
Compiler Design 7. Top-Down Table-Driven Parsing
LALR Parsing Adapted from Notes by Profs Aiken and Necula (UCB) and
Compiler Construction
MathWorks Compiler Course – Day 4
Subject: Language Processor
Exam Topics Hal Perkins Autumn 2009
Chapter 2 :: Programming Language Syntax
Theory of Computation Lecture #
5. Bottom-Up Parsing Chih-Hung Wang
Syntax Analysis - 3 Chapter 4.
Kanat Bolazar February 16, 2010
LR(1) grammars The Chinese University of Hong Kong Fall 2011
Chapter 2 :: Programming Language Syntax
Review for the Midterm. Overview (Chapter 1):
Exam Topics Hal Perkins Winter 2008
Compiler design Review COMP 442/6421 – Compiler Design
Presentation transcript:

50/50 rule You need to get 50% from tests, AND from assignments and labs

Valid topics Anything that was mentioned in the lectures Also check lecture slides and the textbook. Assignments will be tested

Important topics Lexing Parsing Understand grammar Write a grammar RE, NFA, DFA RE to NFA, NFA to DFA, DFA minimization Parsing CFG LL parsing LR parsing Understand grammar Write a grammar Write a parser or translator Understand how parser works Shift/reduce conflicts

Lexing What is lexing? what is a lexer? How does a lexer relate to NFA/DFA theory? How does a lexer fit in with the rest of a compiler? What is a regular language? How do you write a regular expression, based on a narrative description of the pattern? How do you make an NFA based on an RE? How to transform NFA to DFA? How to minimize DFA? How is an NFA different from a DFA?

Parsing What is a context-free grammar? What is the grammar hierarchy? What is parsing? What is a parser? How does a parser relate to CFG theory? What is a leftmost derivation and rightmost derivation? What is a parse tree? What is ambiguity? How to remove ambiguity?

LL parsing What is FIRST()? What is FOLLOWS()? How do you fix left recursion? How do you fix common prefixes? How do you build a parse table? How do you run an LL parser?

LR parsing What is a shift/reduce conflict? How do you fix a shift/reduce conflict? What is LR(0) configuration (item)? What is LR(1) item? What is CLOSURE()? What is Successor(S, A)? How to draw transition diagram for LR(0), SLR, LR(1)? How to construct parsing table for LR(0), SLR, LR(1)? How to run LR(0)/SLR/LR(1) parser? How to decide whether a grammar is LR(0)/SLR/LR(1)? What is the difference between LR(0), SLR, LR(1) and LALR? Which LR algorithm does javaCUP, yacc use?