Trees, Derivations and Ambiguity A grammar A tree 3 derivations - PowerPoint PPT Presentation

Aug 18, 2022 •7 likes •107 views

Trees, Derivations and Ambiguity A grammar A tree 3 derivations correspond to same tree (same rules being used in the same places, just written in different orders in the linear derivation) 1) E => P+E => a+E => a+P => a+a 2) E

Trees, Derivations and Ambiguity
A grammar A tree 3 derivations correspond to same tree (same rules being used in the same places, just written in different orders in the linear derivation) 1) E => P+E => a+E => a+P => a+a 2) E => P+E => P+P => a+P => a+a 3) E => P+E => P+P => P+a => a+a But only one leftmost derivation corresponds to it (and vice versa). (see HW#7 for more)
Another grammar for the same language: E → E+E | E*E | (E) | a This grammar is ambiguous: there is a string in L(G) with two different parse trees, or, equivalently, with 2 different leftmost derivations. Note the pragmatic difference: in general, (a+a)*a != a+(a*a); which is right?
The “E, P” grammar again This grammar is un ambiguous. (Why? Very informally, the 3 E rules generate P((‘+’ ∪ ’*’)P) * and only via a parse tree that “hangs to the right”, as shown.) But it has another undesirable feature: Parse tree structure does not reflect the usual precedence of * over +. E.g., tree at lower right suggests “a * a + a == a * (a + a)”
A more complex grammar, again the same language. This one is unambiguous and its parse trees reflect usual precedence/associativity of plus and times.
Can we always tweak the grammar to make it unambiguous? No! This language is a CFL; see grammar at left. Easy to see this G is ambiguous. Hard to prove, but true, that every G for this L is also ambiguous. Hopefully this is fairly intuitive–strings of the form a n b n c n can come from the i=j or j=k path G is ambiguous L is inherently ambiguous , meaning every G for L is ambiguous
Some closure results for CFLs

Recommend

1 Parse Trees Parse trees are a representation of derivations that is much more compact. Several

1 Parse Trees Parse trees are a representation of derivations that is much more compact. Several derivations may correspond to the same parse tree. For example, in the balanced parenthesis grammar, the following parse tree: s s s ( s ) (

170 views • 6 slides

Parse Trees Definitions Relationship to Left- and Rightmost Derivations Ambiguity in Grammars

Parse Trees Definitions Relationship to Left- and Rightmost Derivations Ambiguity in Grammars 1 Parse Trees Parse trees are trees labeled by symbols of a particular CFG. Leaves: labeled by a terminal or . Interior nodes:

366 views • 32 slides

Outline Grammar Formalisms Syntax in LTAG The derivation tree 1 Design principles for

Outline Grammar Formalisms Syntax in LTAG The derivation tree 1 Design principles for elementary trees 2 Laura Kallmeyer, Timm Lichte, Wolfgang Maier Sample derivations Universit at T ubingen 3 30.04.2007 Syntax in LTAG 1 Syntax

342 views • 6 slides

Structural Ambiguity How different parse trees may be produced from the same sentence or phrase

Constituency Parsing Structural Ambiguity How different parse trees may be produced from the same sentence or phrase Attachment ambiguity: where a constituent may attach to the rest of the tree I saw a man with a telescope

183 views • 17 slides

Compilers Derivations Alex Aiken Derivations A derivation is a sequence of productions S

Compilers Derivations Alex Aiken Derivations A derivation is a sequence of productions S A derivation can be drawn as a tree Start symbol is the trees root For a production X Y 1 Y n

263 views • 22 slides

Describing Syntax and Semantics of Progr a mming L a ngu a ges Part II 1 Ambiguity A grammar

Describing Syntax and Semantics of Progr a mming L a ngu a ges Part II 1 Ambiguity A grammar that generates a sentence for which there are two or more distinct parse trees is said to be ambiguous . Example: ambiguous grammar for simple

752 views • 37 slides

Trees I think that I shall never see Trees I A poem lovely as a tree -- J. Kilmer Trees

Trees I think that I shall never see Trees I A poem lovely as a tree -- J. Kilmer Trees Anatomy of a Tree a In CS, we look at trees Node from the bottom up Basic element of the tree b c Contains a piece of

321 views • 5 slides

AVL Trees AVL Tree Definition (9.2) AVL trees are 4 44 balanced. 2 3 An AVL Tree is a 17

1 8 6 z 4 3 v AVL Trees AVL Trees AVL Tree Definition (9.2) AVL trees are 4 44 balanced. 2 3 An AVL Tree is a 17 78 binary search tree 1 2 1 88 32 50 such that for every 1 1 internal node v of T, 48 62 the heights of

453 views • 9 slides

Concepts Introduced in Chapter 4 Grammars Context-Free Grammars Derivations and Parse

Concepts Introduced in Chapter 4 Grammars Context-Free Grammars Derivations and Parse Trees Ambiguity, Precedence, and Associativity Top Down Parsing Recursive Descent, LL Bottom Up Parsing SLR, LR, LALR Yacc

1.61k views • 83 slides

Concepts Introduced in Chapter 4 Grammars Context-Free Grammars Derivations and Parse

911 views • 73 slides

MA/CSSE 474 Theory of Computation Removing Ambiguity Chomsky Normal Form Pushdown Automata

1/16/2012 MA/CSSE 474 Theory of Computation Removing Ambiguity Chomsky Normal Form Pushdown Automata Recap: Ambiguity A grammar is ambiguous iff there is at least one string in L ( G ) for which G produces more than one parse tree. For many

486 views • 32 slides

Derivations vs Parses Grammar is used to derive string or construct parser A derivation is a

9/18/2012 Derivations vs Parses Grammar is used to derive string or construct parser A derivation is a sequence of applications of rules Starting from the start symbol S ... ... ... (sentence) Context Free Gram m ars

401 views • 5 slides

Ambiguity and the Lexicon in Natural Language Informatics 2A: Lecture 12 2 The Lexicon Word

Ambiguity in Language Ambiguity in Language The Lexicon The Lexicon 1 Ambiguity in Language Derivations and Structural Ambiguity Dealing with Ambiguity Ambiguity and the Lexicon in Natural Language Informatics 2A: Lecture 12 2 The Lexicon

100 views • 6 slides

AVL Trees AVL Tree AVL trees are Height of an AVL Tree 4 balanced. 44 Insertion and

AVL Trees AVL Tree AVL trees are Height of an AVL Tree 4 balanced. 44 Insertion and restructuring An AVL Tree is a 2 3 Removal and restructuring 17 78 binary search tree Costs 1 2 1 such that for every 32 50 88 internal

294 views • 7 slides

4.6: Ambiguity of Grammars In this section, we say what it means for a grammar to be ambiguous.

4.6: Ambiguity of Grammars In this section, we say what it means for a grammar to be ambiguous. We also give a straightforward method for disambiguating grammars for languages with operators of various precedences and associativities, and

615 views • 42 slides

CS 220: Discrete Structures and their Applications Trees Chapter 11 in zybooks trees A tree is

CS 220: Discrete Structures and their Applications Trees Chapter 11 in zybooks trees A tree is an undirected graph that is connected and has no cycles. rooted trees Rooted trees. Given a tree T, choose a root node r and orient each edge

814 views • 52 slides

Context-Free Grammars Formalism Derivations Backus-Naur Form Left- and Rightmost Derivations 1

Context-Free Grammars Formalism Derivations Backus-Naur Form Left- and Rightmost Derivations 1 Informal Comments A context-free grammar is a notation for describing languages. It is more powerful than finite automata or REs, but

754 views • 28 slides

Context-Free Grammars Formalism Derivations Backus-Naur Form Left- and Rightmost Derivations 1

1.41k views • 96 slides

Trees (Part 2) 1 / 59 Trees (Part 2) Recap Recap 2 / 59 Trees (Part 2) Recap B + Tree A B

Trees (Part 2) Trees (Part 2) 1 / 59 Trees (Part 2) Recap Recap 2 / 59 Trees (Part 2) Recap B + Tree A B + Tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and

811 views • 59 slides

Parsing beyond context-free grammar: adjunction: replacing an internal node with a new tree.

Kallmeyer/Maier ESSLLI 2008 Kallmeyer/Maier ESSLLI 2008 Tree Adjoining Grammars (1) A Tree Adjoining Grammars (TAG) (Joshi & Schabes 1997) is a tree-rewriting system, i.e., a set of elementary trees with two operations: Parsing beyond

407 views • 11 slides

Lecture 1: Trees, tree metric and tree spaces Piotr Zwiernik University of Genoa Algebraic

Introduction Trees Tree metrics Phylogenetic oranges Tree correlations Further concepts Lecture 1: Trees, tree metric and tree spaces Piotr Zwiernik University of Genoa Algebraic Statistics 2015 Genova June 11, 2015 Lecture 1: Trees,

976 views • 85 slides

TREES AND THE LAW A GUIDE TO THE ESSENTIAL POINTS OF TREES AND THE LAW TREE PRESERVATION ORDERS

TREES AND THE LAW A GUIDE TO THE ESSENTIAL POINTS OF TREES AND THE LAW TREE PRESERVATION ORDERS A local planning authority can serve a TPO on tree(s) when it is expedient to do so. Such trees need to: Have a reasonable degree of

333 views • 10 slides

Binary Search Trees A binary search tree is a binary tree T such that - each internal node

AVL T REES Binary Search Trees AVL Trees AVL Trees 1 Binary Search Trees A binary search tree is a binary tree T such that - each internal node stores an item (k, e) of a dictionary. - keys stored at nodes in the left subtree of

547 views • 26 slides

Grammar Implementation with Lexicalized Tree Adjoining Grammars and Frame Semantics Grammar

Grammar Implementation with Lexicalized Tree Adjoining Grammars and Frame Semantics Grammar implementation with XMG: Frames Laura Kallmeyer, Timm Lichte, Rainer Osswald & Simon Petitjean University of Dsseldorf DGfS Fall School, September

407 views • 20 slides