left corner parsing
play

Left-corner parsing Laura Kassner laura.kassner@gmx.de - PowerPoint PPT Presentation

Jan 01, 2024 •2.15k likes •4.09k views

Left-corner parsing Laura Kassner laura.kassner@gmx.de Computational Linguistics II: Parsing January 10th, 2007 Left-corner parsing Basics Building a left-corner recognizer... ... and transforming it into a parser Comparison to

  1. Building a left-corner recognizer Procedures MOVE => right-hand-side of rule whose left-hand-side is A has been completely processed, A was recognized => push A onto SENTENCE => remove the 't' from CATEGORIES => remove A from CONSTITUENTS

  2. Building a left-corner recognizer Procedures REMOVE

  3. Building a left-corner recognizer Procedures REMOVE Precondition: first(SENTENCE) = first(CATEGORIES)

  4. Building a left-corner recognizer Procedures REMOVE Precondition: first(SENTENCE) = first(CATEGORIES) Input: SENTENCE; CATEGORIES; CONSTITUENTS

  5. Building a left-corner recognizer Procedures REMOVE Precondition: first(SENTENCE) = first(CATEGORIES) Input: SENTENCE; CATEGORIES; CONSTITUENTS Output: pop(SENTENCE); pop(CATEGORIES); CONSTITUENTS

  6. Building a left-corner recognizer Procedures REMOVE => is applied iff first(SENTENCE) is a category k i , a left corner, and this category has been recognized

  7. Building a left-corner recognizer The Algorithm

  8. Building a left-corner recognizer The Algorithm RECOGNIZE LC

  9. Building a left-corner recognizer The Algorithm RECOGNIZE LC Data: CFG G = <N, T, S, R> Lexicon L sentence w = w 1 ... w n , n >= 1

  10. Building a left-corner recognizer The Algorithm RECOGNIZE LC Data: CFG G = <N, T, S, R> Lexicon L sentence w = w 1 ... w n , n >= 1 Input: SENTENCE = [w 1 ... w n ]; CATEGORIES = [S]; CONSTITUENTS = [ ]

  11. Building a left-corner recognizer The Algorithm RECOGNIZE LC Data: CFG G = <N, T, S, R> Lexicon L sentence w = w 1 ... w n , n >= 1 Input: SENTENCE = [w 1 ... w n ]; CATEGORIES = [S]; CONSTITUENTS = [ ] Output: true / false

  12. Building a left-corner recognizer The Algorithm RECOGNIZE LC Method: if (SENTENCE == CATEGORIES == CONSTITUENTS == [ ]) return true; else if (there is a procedure P Є {REDUCE, MOVE, REMOVE} whose preconditions are met) RECOGNIZE LC (P(SENTENCE, CATEGORIES, CONSTITUENTS)); else return false;

  13. Building a left-corner recognizer Example Der Meister sucht einen Fehler

  14. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE

  15. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE

  16. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE

  17. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE

  18. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE [sucht einen F...] [t n t S] [n NP] MOVE

  19. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE [sucht einen F...] [t n t S] [n NP] MOVE [n sucht einen F...] [n t S] [NP] REMOVE

  20. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE [sucht einen F...] [t n t S] [n NP] MOVE [n sucht einen F...] [n t S] [NP] REMOVE [sucht einen F...] [t S] [NP] MOVE

  21. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE [sucht einen F...] [t n t S] [n NP] MOVE [n sucht einen F...] [n t S] [NP] REMOVE [sucht einen F...] [t S] [NP] MOVE [NP sucht einen...] [S] [ ] REDUCE

  22. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE [sucht einen F...] [t n t S] [n NP] MOVE [n sucht einen F...] [n t S] [NP] REMOVE [sucht einen F...] [t S] [NP] MOVE [NP sucht einen...] [S] [ ] REDUCE [sucht einen F...] [VP t S] [S] REDUCE

  23. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE [sucht einen F...] [t n t S] [n NP] MOVE [n sucht einen F...] [n t S] [NP] REMOVE [sucht einen F...] [t S] [NP] MOVE [NP sucht einen...] [S] [ ] REDUCE [sucht einen F...] [VP t S] [S] REDUCE [einen Fehler] [t VP t S] [v S] MOVE

  24. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE [sucht einen F...] [t n t S] [n NP] MOVE [n sucht einen F...] [n t S] [NP] REMOVE [sucht einen F...] [t S] [NP] MOVE [NP sucht einen...] [S] [ ] REDUCE [sucht einen F...] [VP t S] [S] REDUCE [einen Fehler] [t VP t S] [v S] MOVE [v einen Fehler] [VP t S] [S] REDUCE

  25. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE [sucht einen F...] [t n t S] [n NP] MOVE [n sucht einen F...] [n t S] [NP] REMOVE [sucht einen F...] [t S] [NP] MOVE [NP sucht einen...] [S] [ ] REDUCE [sucht einen F...] [VP t S] [S] REDUCE [einen Fehler] [t VP t S] [v S] MOVE [v einen Fehler] [VP t S] [S] REDUCE [einen Fehler] [NP t VP t S] [VP S] REDUCE

  26. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE [sucht einen F...] [t n t S] [n NP] MOVE [n sucht einen F...] [n t S] [NP] REMOVE [sucht einen F...] [t S] [NP] MOVE [NP sucht einen...] [S] [ ] REDUCE [sucht einen F...] [VP t S] [S] REDUCE [einen Fehler] [t VP t S] [v S] MOVE [v einen Fehler] [VP t S] [S] REDUCE [einen Fehler] [NP t VP t S] [VP S] REDUCE [Fehler] [t NP t VP t S] [det VP S] MOVE

  27. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE [sucht einen F...] [t n t S] [n NP] MOVE [n sucht einen F...] [n t S] [NP] REMOVE [sucht einen F...] [t S] [NP] MOVE [NP sucht einen...] [S] [ ] REDUCE [sucht einen F...] [VP t S] [S] REDUCE [einen Fehler] [t VP t S] [v S] MOVE [v einen Fehler] [VP t S] [S] REDUCE [einen Fehler] [NP t VP t S] [VP S] REDUCE [Fehler] [t NP t VP t S] [det VP S] MOVE [det Fehler] [NP t VP t S] [VP S] REDUCE

  28. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE [sucht einen F...] [t n t S] [n NP] MOVE [n sucht einen F...] [n t S] [NP] REMOVE [sucht einen F...] [t S] [NP] MOVE [NP sucht einen...] [S] [ ] REDUCE [sucht einen F...] [VP t S] [S] REDUCE [einen Fehler] [t VP t S] [v S] MOVE [v einen Fehler] [VP t S] [S] REDUCE [einen Fehler] [NP t VP t S] [VP S] REDUCE [Fehler] [t NP t VP t S] [det VP S] MOVE [det Fehler] [NP t VP t S] [VP S] REDUCE [Fehler] [n t NP t VP t S] [NP VP S] REDUCE

  29. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [der Meister su...] [S] [ ] REDUCE [Meister sucht...] [t S] [det] MOVE [det Meister su...] [S] [ ] REDUCE [Meister sucht...] [n t S] [NP] REDUCE [sucht einen F...] [t n t S] [n NP] MOVE [n sucht einen F...] [n t S] [NP] REMOVE [sucht einen F...] [t S] [NP] MOVE [NP sucht einen...] [S] [ ] REDUCE [sucht einen F...] [VP t S] [S] REDUCE [einen Fehler] [t VP t S] [v S] MOVE [v einen Fehler] [VP t S] [S] REDUCE [einen Fehler] [NP t VP t S] [VP S] REDUCE [Fehler] [t NP t VP t S] [det VP S] MOVE [det Fehler] [NP t VP t S] [VP S] REDUCE [Fehler] [n t NP t VP t S] [NP VP S] REDUCE [ ] [t n t NP t VP t S] [n NP VP S] MOVE

  30. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [ ] [t n t NP t VP t S] [n NP VP S] MOVE

  31. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [ ] [t n t NP t VP t S] [n NP VP S] MOVE [n] [n t NP t VP t S] [NP VP S] REMOVE

  32. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [ ] [t n t NP t VP t S] [n NP VP S] MOVE [n] [n t NP t VP t S] [NP VP S] REMOVE [ ] [t NP t VP t S] [NP VP S] MOVE

  33. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [ ] [t n t NP t VP t S] [n NP VP S] MOVE [n] [n t NP t VP t S] [NP VP S] REMOVE [ ] [t NP t VP t S] [NP VP S] MOVE [NP] [NP t VP t S] [VP S] REMOVE

  34. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [ ] [t n t NP t VP t S] [n NP VP S] MOVE [n] [n t NP t VP t S] [NP VP S] REMOVE [ ] [t NP t VP t S] [NP VP S] MOVE [NP] [NP t VP t S] [VP S] REMOVE [ ] [t VP t S] [VP S] MOVE

  35. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [ ] [t n t NP t VP t S] [n NP VP S] MOVE [n] [n t NP t VP t S] [NP VP S] REMOVE [ ] [t NP t VP t S] [NP VP S] MOVE [NP] [NP t VP t S] [VP S] REMOVE [ ] [t VP t S] [VP S] MOVE [VP] [VP t S] [S] REMOVE

  36. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [ ] [t n t NP t VP t S] [n NP VP S] MOVE [n] [n t NP t VP t S] [NP VP S] REMOVE [ ] [t NP t VP t S] [NP VP S] MOVE [NP] [NP t VP t S] [VP S] REMOVE [ ] [t VP t S] [VP S] MOVE [VP] [VP t S] [S] REMOVE [ ] [t S] [S] MOVE

  37. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [ ] [t n t NP t VP t S] [n NP VP S] MOVE [n] [n t NP t VP t S] [NP VP S] REMOVE [ ] [t NP t VP t S] [NP VP S] MOVE [NP] [NP t VP t S] [VP S] REMOVE [ ] [t VP t S] [VP S] MOVE [VP] [VP t S] [S] REMOVE [ ] [t S] [S] MOVE [S] [S] [ ] REMOVE

  38. Building a left-corner recognizer Example Der Meister sucht einen Fehler SENTENCE CATEGORIES CONSTITUENTS procedure [ ] [t n t NP t VP t S] [n NP VP S] MOVE [n] [n t NP t VP t S] [NP VP S] REMOVE [ ] [t NP t VP t S] [NP VP S] MOVE [NP] [NP t VP t S] [VP S] REMOVE [ ] [t VP t S] [VP S] MOVE [VP] [VP t S] [S] REMOVE [ ] [t S] [S] MOVE [S] [S] [ ] REMOVE [ ] [ ] [ ] true

  39. Building a left-corner recognizer Why is RECOGNIZE LC non-deterministic?

  40. Building a left-corner recognizer Why is RECOGNIZE LC non-deterministic? ● there may be several rules whose left corner is equal to first(SENTENCE)

  41. Building a left-corner recognizer Why is RECOGNIZE LC non-deterministic? ● there may be several rules whose left corner is equal to first(SENTENCE) ● there may be configurations where you could either REDUCE or REMOVE:

  42. Building a left-corner recognizer Why is RECOGNIZE LC non-deterministic? ● there may be several rules whose left corner is equal to first(SENTENCE) ● there may be configurations where you could either REDUCE or REMOVE: ● a newly created structure can be used to complete the structure we are working at => REMOVE

  43. Building a left-corner recognizer Why is RECOGNIZE LC non-deterministic? ● there may be several rules whose left corner is equal to first(SENTENCE) ● there may be configurations where you could either REDUCE or REMOVE: ● a newly created structure can be used to complete the structure we are working at => REMOVE ● or it could constitute a new structure of its own => REDUCE

  44. Building a left-corner recognizer => use breadth-first or depth-first search to check all possible configurations

  45. Building a left-corner recognizer breadth-first search RECOGNIZE LC/BF Data: CFG G = <N, T, S, R> Lexicon L sentence w = w 1 ... w n , n >= 1 Input: SENTENCE = [w 1 ... w n ]; CATEGORIES = [S]; CONSTITUENTS = [ ] Output: true / false Structures: CONFIGS – set of configurations, null at the beginning

  46. Building a left-corner recognizer breadth-first search RECOGNIZE LC/BF Method: if (SENTENCE == CATEGORIES == CONSTITUENTS == [ ]) return true; else CONFIGS = set of all configurations derivable from the actual configuration using REMOVE, REDUCE or MOVE if (CONFIGS == null) return false; else for every configuration C Є CONFIGS: RECOGNIZE LC/BF (SENTENCE C , CATEGORIES C , CONSTITUENTS C );

  47. Questions?

  48. A left-corner parsing algorithm

  49. A left-corner parsing algorithm ● introduce another stack: STRUCTURE

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Models of Human Parsing Experimental Data 2 Informatics 2A: Lecture 22 Eye-tracking Reading

Models of Human Parsing Experimental Data 2 Informatics 2A: Lecture 22 Eye-tracking Reading

Human Parsing Human Parsing Experimental Data Experimental Data Bottom-Up Parser Bottom-Up Parser Left Corner Parser Left Corner Parser Human Parsing 1 Cognitive Constraints Garden Paths Dimensions of Parsing Models of Human Parsing

537 views • 9 slides
Computational Linguistics II: Parsing Left-corner-Parsing Frank Richter &amp; Jan-Philipp S

Computational Linguistics II: Parsing Left-corner-Parsing Frank Richter &amp; Jan-Philipp S

Computational Linguistics II: Parsing Left-corner-Parsing Frank Richter &amp; Jan-Philipp S ohn fr@sfs.uni-tuebingen.de, jp.soehn@uni-tuebingen.de January 15th, 2007 Richter/S ohn (WS 2006/07) Computational Linguistics II: Parsing

648 views • 29 slides
Left-Corner Parsing Parsing Tricks Technique for 1 word of lookahead in algorithms like

Left-Corner Parsing Parsing Tricks Technique for 1 word of lookahead in algorithms like

Left-Corner Parsing Parsing Tricks Technique for 1 word of lookahead in algorithms like Earleys (can also do multi-word lookahead but its harder) 600.465 - Intro to NLP - J. Eisner 1 600.465 - Intro to NLP - J. Eisner 2 Basic

304 views • 6 slides
Using Left-corner Parsing to Encode Universal Structural Constraints in Grammar Induction

Using Left-corner Parsing to Encode Universal Structural Constraints in Grammar Induction

Using Left-corner Parsing to Encode Universal Structural Constraints in Grammar Induction Hiroshi Noji Yusuke Miyao Mark Johnson Nara Institute of National Institute of Macquarie University Science and Technology Informatics 1

565 views • 21 slides
Bottom Up Parsing Also known as Shift-Reduce parsing More powerful than top down Dont

Bottom Up Parsing Also known as Shift-Reduce parsing More powerful than top down Dont

9/26/2012 Bottom Up Parsing Also known as Shift-Reduce parsing More powerful than top down Dont need left factored grammars Can handle left recursion Bottom Up Parsing Attempt to construct parse tree from an input string

654 views • 6 slides
Plan for Today Predictive parsing as a specific subclass of recursive descent parsing

Plan for Today Predictive parsing as a specific subclass of recursive descent parsing

Plan for Today Predictive parsing as a specific subclass of recursive descent parsing complexity comparisons with general parsing might have to left-factor necessary to remove left-recursion (MiniSVG modification as example) Working

346 views • 5 slides
Let us look at the morphemes associated with some of the edges. Edge 126, in the top left corner,

Let us look at the morphemes associated with some of the edges. Edge 126, in the top left corner,

Let us look at the morphemes associated with some of the edges. Edge 126, in the top left corner, contains the following labels (stems). The ones in blue are surely correct; the shorter ones, like eth- or com- are probably incorrect. Edge number

411 views • 6 slides
c o mme nts, ple ase c lic k o n the ic o n in the top left corner o f this do c ume nt Port of

c o mme nts, ple ase c lic k o n the ic o n in the top left corner o f this do c ume nt Port of

Ple ase no te : to vie w the pre se nte rs c o mme nts, ple ase c lic k o n the ic o n in the top left corner o f this do c ume nt Port of San Francisco Achieving Public Trust Objectives November 2016 Public Trust Elements Public

492 views • 35 slides
Plan for Today Recall Predictive Parsing when it works and when it doesnt necessary to

Plan for Today Recall Predictive Parsing when it works and when it doesnt necessary to

Plan for Today Recall Predictive Parsing when it works and when it doesnt necessary to remove left-recursion might have to left-factor Error recovery for predictive parsers Predictive parsing as a specific subclass of recursive

590 views • 10 slides
Computational Linguistics II: Parsing Overview, Left-Recursion, Bottom-up Parsing Frank Richter

Computational Linguistics II: Parsing Overview, Left-Recursion, Bottom-up Parsing Frank Richter

Computational Linguistics II: Parsing Overview, Left-Recursion, Bottom-up Parsing Frank Richter &amp; Jan-Philipp S ohn fr@sfs.uni-tuebingen.de, jp.soehn@uni-tuebingen.de Computational Linguistics II: Parsing p.1 The Big Picture

667 views • 43 slides
Stockmeyer Algorithm Determine optimal orientation of the blocks Internal nodes in the

Stockmeyer Algorithm Determine optimal orientation of the blocks Internal nodes in the

Stockmeyer Algorithm Determine optimal orientation of the blocks Internal nodes in the slicing tree: top-H-bottom, left-V-right lower-left corner of the block lower-left corner of its room Block dimension: (2,4), (1,3), (3,3),

519 views • 7 slides
Lectures 7 and 8. Parsing (syntax analysis) Wei Le 2015.9 Bottom Up Parsing Recognize many

Lectures 7 and 8. Parsing (syntax analysis) Wei Le 2015.9 Bottom Up Parsing Recognize many

Lectures 7 and 8. Parsing (syntax analysis) Wei Le 2015.9 Bottom Up Parsing Recognize many programming languages, used in practice More general, more powerful parser: less restrictions on grammars, e.g., can handle left-recursive grammar

680 views • 64 slides
Nametag Glyph Fold your paper in half and write your name in the center. In the top left

Nametag Glyph Fold your paper in half and write your name in the center. In the top left

Nametag Glyph Fold your paper in half and write your name in the center. In the top left corner, write the number of years you have been teaching. In the top right corner, draw a symbol or picture of what you like to do in your leisure

857 views • 60 slides
the lower left corner of the each slide. HEALTH SYSTEMS DIVISION Licensing and Certification Unit

the lower left corner of the each slide. HEALTH SYSTEMS DIVISION Licensing and Certification Unit

Before the presentation starts, please note that you will need to manually advance each slide. Upon audio conclusion, an orange arrow will appear in the upper right corner of each slide indicating its time to advance to the next slide. To

805 views • 41 slides
Memory-Bounded Left-Corner Unsupervised Grammar Induction on Child-Directed Input Cory Shain 1 ,

Memory-Bounded Left-Corner Unsupervised Grammar Induction on Child-Directed Input Cory Shain 1 ,

Memory-Bounded Left-Corner Unsupervised Grammar Induction on Child-Directed Input Cory Shain 1 , William Bryce 2 , Lifeng Jin 1 , Victoria Krakovna 3 , Finale Doshi-Velez 4 , Timothy Miller 5 , 6 , William Schuler 1 , and Lane Schwartz 2 1 Dept of

1.3k views • 104 slides
CS453 : JavaCUP and error recovery CS453 Shift-reduce Parsing 1 Shift-reduce parsing in an LR

CS453 : JavaCUP and error recovery CS453 Shift-reduce Parsing 1 Shift-reduce parsing in an LR

CS453 : JavaCUP and error recovery CS453 Shift-reduce Parsing 1 Shift-reduce parsing in an LR parser LR(k) parser Left-to-right parse Right-most derivation K-token look ahead LR parsing algorithm using an LR parse table

591 views • 9 slides
Decision problems for Clark-congruential languages Makoto Kanazawa 1 e 2 Tobias Kapp 1 Hosei

Decision problems for Clark-congruential languages Makoto Kanazawa 1 e 2 Tobias Kapp 1 Hosei

Decision problems for Clark-congruential languages Makoto Kanazawa 1 e 2 Tobias Kapp 1 Hosei University, Tokyo 2 University College London Work performed at the National Institute of Informatics, Tokyo. LearnAut, July 13, 2018 1 Introduction

1.23k views • 91 slides
Grammar Flow Analysis Wilhelm/Maurer: Compiler Design, Chapter 8 Reinhard Wilhelm

Grammar Flow Analysis Wilhelm/Maurer: Compiler Design, Chapter 8 Reinhard Wilhelm

Grammar Flow Analysis Grammar Flow Analysis Wilhelm/Maurer: Compiler Design, Chapter 8 Reinhard Wilhelm Universitt des Saarlandes wilhelm@cs.uni-sb.de 2. November 2009 Grammar Flow Analysis Notation Generic names for A , B , C ,

563 views • 27 slides
ARTIFICIAL INTELLIGENCE Classical planning (goal-directed) Lecturer: Silja Renooij These slides

ARTIFICIAL INTELLIGENCE Classical planning (goal-directed) Lecturer: Silja Renooij These slides

Utrecht University INFOB2KI 2019-2020 The Netherlands ARTIFICIAL INTELLIGENCE Classical planning (goal-directed) Lecturer: Silja Renooij These slides are part of the INFOB2KI Course Notes available from

664 views • 62 slides
Discourse BSc Artificial Intelligence, Spring 2011 Raquel Fernndez Institute for Logic,

Discourse BSc Artificial Intelligence, Spring 2011 Raquel Fernndez Institute for Logic,

Discourse BSc Artificial Intelligence, Spring 2011 Raquel Fernndez Institute for Logic, Language &amp; Computation University of Amsterdam Raquel Fernndez Discourse BSc AI 2011 1 / 29 Course Practicalities Raquel Fernndez

575 views • 29 slides
von Neumann's bottleneck von Neumann machine One control unit that connects memory and

von Neumann's bottleneck von Neumann machine One control unit that connects memory and

von Neumann's bottleneck von Neumann machine One control unit that connects memory and processor Lecture 2: The connection between processor and memory is a bottleneck Performance Limitations Memory Bottleneck &amp;

559 views • 34 slides
Fuego Test System Tim Bird Architecture Group Chair 1 LF CE Workgroup 1 10/23/2014 PA1

Fuego Test System Tim Bird Architecture Group Chair 1 LF CE Workgroup 1 10/23/2014 PA1

Fuego Introduction to the Fuego Test System Tim Bird Architecture Group Chair 1 LF CE Workgroup 1 10/23/2014 PA1 Confidential Fuego Introduction to the Fuego Test System Tim Bird Architecture Group Chair 2 LF CE Workgroup 2

898 views • 53 slides
Fuego Status and Roadmap BOF Tim Bird Architecture Group Chair 1 LF CE Workgroup 1

Fuego Status and Roadmap BOF Tim Bird Architecture Group Chair 1 LF CE Workgroup 1

Fuego Fuego Status and Roadmap BOF Tim Bird Architecture Group Chair 1 LF CE Workgroup 1 10/23/2014 PA1 Confidential Fuego Fuego Status and Roadmap BOF Tim Bird Architecture Group Chair 2 LF CE Workgroup 2 10/23/2014 PA1

1.18k views • 50 slides
While-Loops A Motivating Example try: result = input('Number: ') # get number x =

While-Loops A Motivating Example try: result = input('Number: ') # get number x =

Module 26 While-Loops A Motivating Example try: result = input('Number: ') # get number x = float(input) # convert to float print('The next number is '+str(x+1)) except: print('That is not a number! Try again)

602 views • 31 slides

More recommend