Module29Worksheet - 2) For a given parse tree T, is it true...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Module 29 Worksheet In Class Questions 1) (S5) What is wrong with the following parse tree for ( ) from BALG? S | (S) | λ 2) (S8) Draw the corresponding parse tree (see slide 8). 3) (S8) Draw the corresponding rightmost derivation (see slide 8). 4) (S8) Draw the corresponding parse tree (see slide 8) 5) (S8) Draw the corresponding leftmost derivation (see slide 8)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Take home review questions 1) What does it mean for a derivation to be a leftmost derivation?
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2) For a given parse tree T, is it true that only one derivation corresponds to it? 3) What is wrong with the following statement: I can prove G is an ambiguous grammar by showing that G has two leftmost derivations. 4) Why would it be bad if we built a compiler for a programming language PL using an ambiguous grammar PLG for PL? 5) What is the definition of an inherently ambiguous context-free language L?...
View Full Document

Page1 / 2

Module29Worksheet - 2) For a given parse tree T, is it true...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online