Concepts Of Programming Languages
Concepts Of Programming Languages
12th Edition
ISBN: 9780134997186
Author: Sebesta, Robert W.
Publisher: Pearson,
Expert Solution & Answer
Book Icon
Chapter 4, Problem 19RQ

Explanation of Solution

Phrase of a sentential form:

Phrase in a parse tree is the string of terminals collected from the leaves of the partial parse tree, rooted at one specific internal node in the original parse tree. Now we can define phrase in a sentential form more precisely.

  • Phrase can be used to define handle in the right sentential. For a right sentential form γ=αβw, β is the handle if and only if *rmαAw  rmαβw.
  • This means that β is the handle γ=αβw , if β can be reduced to a non-terminal in one right most derivation (A) and resulting sentential form can be reduced to the start symbol on zero or more right most derivations

Blurred answer
Students have asked these similar questions
What is a simple phrase of a sentential form?
What does inferential mean
What are the advantages of referential transparency?