LLk Parsing

Jul 10, 2013

170 likes | 506 Vues

February 8, 2000. 8. LL Parsing. 2. Overview. . February 8, 2000. 8. LL Parsing. 3. Leftmost Derviations versus Rightmost Derivations. leftmost derivationat each step in derivation, rewrite the leftmost nonterminal symbolrightmost derivationat each step in derivation, rewrite the rightmost nonter

Share Presentation

Embed Code

Link

kert

Télécharger la présentation

LLk Parsing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

Parsing

Parsing. Machine Code. Program File. Add v,v,5 cmp v,5 jmplt ELSE THEN: add x, 12,v ELSE: WHILE: cmp x,3 . v = 5; if (v>5) x = 12 + v; while (x !=3) { x = x - 3; v = 10; } . Compiler. Compiler. Lexical analyzer. parser. Input String. Output. Program file.

728 views • 47 slides

Parsing

Parsing. See: R Garside, G Leech & A McEnery (eds) Corpus Annotation , London (1997): Longman, chapters 11 (Bateman et al) and 12 (Garside & Rayson) G Kennedy, An introduction to corpus linguistics , London (1998): Longman, pp. 231-244.

566 views • 23 slides

Parsing

Parsing. Based on presentations from Chris Manning’s course on Statistical Parsing (Stanford). S. N. VP. V. NP. D. N. hit. John. the. ball. Levels of analysis. Buffalo…. Parsing is a difficult task!. ^______^ so excited! # Khaleesi # miniKhaleesi # GoT. Ambiguities.

1.53k views • 105 slides

Parsing

Parsing. Programming Language Principles Lecture 3. Prepared by Manuel E. Bermúdez, Ph.D. Associate Professor University of Florida. Context-Free Grammars.

518 views • 33 slides

Parsing

Parsing. Chapter 15. The Job of a Parser. Given a context-free grammar G :. Examine a string and decide whether or not it is a syntactically well-formed member of L ( G ), and

1.88k views • 82 slides

Parsing

Parsing. Obtain text from somewhere (file, user input, web page, ..) Analyze text: split it into meaningful tokens Extract relevant information , disregard irrelevant information ‘Meaningful’, ‘relevant’ depend on application: what are we looking for?

455 views • 30 slides

Parsing

Parsing. Discrete Mathematics and Its Applications Baojian Hua bjhua@ustc.edu.cn. Syntax Tree. A systematic way to put some program into memory data type definition + a bunch of functions programmer explicit calls them tedious and error-prone

701 views • 56 slides

Parsing

Università di Pisa. Parsing. Giuseppe Attardi Dipartimento di Informatica Università di Pisa. Question Answering at TREC. Consists of answering a set of 500 fact-based questions, e.g. “When was Mozart born ?” Systems were allowed to return 5 ranked answer snippets to each question.

944 views • 67 slides

Parsing

Parsing. Ambiguous grammars. For instance , consider the sentential form E + E * E It has two derivations from E : E -> E + E -> E + E * E E -> E * E -> E + E * E Draw the parse trees for these derivations.

348 views • 18 slides

Parsing

Parsing. Front-End: Parser. Checks the stream of words and their parts of speech for grammatical correctness. tokens. source code. IR. scanner. parser. errors. Front-End: Parser. Determines if the input is syntactically well formed. tokens. source code. IR. scanner. parser. errors.

761 views • 56 slides

Parsing

Parsing. Parsing. Mål: Et program til indlæsning og beregning af aritmetiske udtryk Eksempel: Beregn (3*5 + 4/2) - 1 Løs et lettere problem først: Læs en streng og undersøg, om den udgør et lovligt aritmetisk udtryk. Grammatik for aritmetiske udtryk.

327 views • 13 slides

Parsing

Parsing. CMPS 450 J. Moloney. Parsing =. Check that input is well-formed Build a parse tree or similar representation of input. Recursive Descent Parsing A collection of recursive routines, each corresponding to one of the nonterminals of a grammar.

372 views • 17 slides

Parsing

Parsing. Top-down v.s. Bottom-up Top-down parsing Recursive-descent parsing LL(1) parsing LL(1) parsing algorithm First and follow sets Constructing LL(1) parsing table Error recovery. Bottom-up parsing Shift-reduce parsers LR(0) parsing LR(0) items Finite automata of items

841 views • 53 slides

Parsing

Parsing. Parsing is the process of determining whether a string of tokens can be generated by a grammar. Most parsing methods fall into one of two classes, called the top-down and bottom-up methods.

274 views • 21 slides

Parsing

Parsing. Analyze text: split it into meaningful units, tokens Extract relevant information , disregard irrelevant information ‘Meaningful’, ‘relevant’ depend on application: what are we looking for? Phone book: meaningful tokens are words, numbers

228 views • 20 slides

Parsing

Parsing. What is Parsing?. S  NP VP NP  Det N NP  NP PP VP  V NP VP  VP PP PP  P NP. NP  Papa N  caviar N  spoon V  spoon V  ate P  with Det  the Det  a. S. NP. VP. VP. PP. V. NP. P. NP. Det. Det. N. N. the. a. Papa. ate. caviar. with. spoon.

423 views • 37 slides

More Related