Programming Language Pragmatics, Fourth Edition
4th Edition
ISBN: 9780124104099
Author: Michael L. Scott
Publisher: Elsevier Science
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 2, Problem 14E
Explanation of Solution
a.
Grammar for LL (1):
Consider the grammar for LL (1) as below:
Grammar for SLR (1):
Consider the grammar for SLR (1) as below:
Explanation of Solution
b.
Parsing table for LL (1) grammar:
| Top-of-stack non-terminal | ( | ) | [ | ] | $$ |
| P | 1 | - | 1 | - | 1 |
| S | 2 | 4 | 3 | 4 | 4 |
- The entries in the above table indicates the production of predict. The “-” means an error.
- If the top-of-stack is terminal, the appropriate action is always to match it against an incoming token from the scanner.
Parsing table for SLR (1) grammar:
| Top-of-stack | S | ( | ) | [ | ] | $$ |
| 0 | s1 | r4 | r4 | r4 | r4 | r4 |
| 1 | - | s2 | - | s3 | - | b1 |
| 2 | s4 | r4 | r4 | r4 | r4 | r4 |
| 3 | s5 | r4 | r4 | r4 | r4 | r4 |
| 4 | - | s2 | b2 | s3 | - | - |
| 5 | - | s2 | - | s3 | b3 | - |
- The entries in the above table indicates whether to shift (s), reduce (r), or shift and then reduce (d). The “-” means an error.
Explanation of Solution
c.
Parsing tree for LL (1):
Parsing tree for SLR (1):
Explanation of Solution
d.
LL (1) trace:
| Parse stack | Input stream | Comment |
| P | ( [ ] ( [ ] ) ) [ ] ( ( ) ) $$ | |
| S $$ | ( [ ] ( [ ] ) ) [ ] ( ( ) ) $$ | Predict P →S $$ |
| ( S ) S $$ | ( [ ] ( [ ] ) ) [ ] ( ( ) ) $$ | Predict S →( S ) S |
| S ) S $$ | [ ] ( [ ] ) ) [ ] ( ( ) ) $$ | Match ( |
| [ S ] S ) S $$ | [ ] ( [ ] ) ) [ ] ( ( ) ) $$ | Predict S →[ S ] S |
| S ] S ) S $$ | ] ( [ ] ) ) [ ] ( ( ) ) $$ | Match [ |
| ] S ) S $$ | ] ( [ ] ) ) [ ] ( ( ) ) $$ | Predict S → ε |
| S ) S $$ | ( [ ] ) ) [ ] ( ( ) ) $$ | Match ] |
| ( S ) S ) S $$ | ( [ ] ) ) [ ] ( ( ) ) $$ | Predict S →( S ) S |
| S ) S ) S $$ | [ ] ) ) [ ] ( ( ) ) $$ | Match ( |
| [ S ] S ) S ) S $$ | [ ] ) ) [ ] ( ( ) ) $$ | Predict S →[ S ] S |
| S ] S ) S ) S $$ | ] ) ) [ ] ( ( ) ) $$ | Match [ |
| ] S ) S ) S $$ | ] ) ) [ ] ( ( ) ) $$ | Predict S → ε |
| S ) S ) S $$ | ) ) [ ] ( ( ) ) $$ | Match ] |
| ) S ) S $$ | ) ) [ ] ( ( ) ) $$ | Predict S → ε |
| S ) S $$ | ) [ ] ( ( ) ) $$ | Predict S → |
| ) S $$ | ) [ ] ( ( ) ) $$ | Predict S → ε |
| S $$ | [ ] ( ( ) ) $$ | Match ) |
| [ S ] S $$ | [ ] ( ( ) ) $$ | Predict S →[ S ] S |
| S ] S $$ | ] ( ( ) ) $$ | Match [ |
| ] S $$ | ] ( ( ) ) $$ | Predict S → ε |
| S $$ | ( ( ) ) $$ | Match ] |
| ( S ) S $$ | ( ( ) ) $$ | Predict S →( S ) S |
| S ) S $$ | ( ) ) $$ | Match ( |
| ( S ) S ) S $$ | ( ) ) $$ | Predict S →( S ) S |
| S ) S ) S $$ | ) ) $$ | Match ( |
| ) S ) S $$ | ) ) $$ | Predict S → ε |
| S ) S $$ | ) $$ | Match ) |
| ) S $$ | ) $$ | Predict S → ε |
| S $$ | $$ | Match ) |
| $$ | $$ | Predict S → ε |
SLR (1) trace:
| Parse stack | Input stream | Comment |
| 0 | ( [ ] ( [ ] ) ) [ ] ( ( ) ) $$ | |
| 0 | S ( [ ] ( [ ] ) ) [ ] ( ( ) ) $$ | Reduce by S→ ε |
| 0S1 | ( [ ] ( [ ] ) ) [ ] ( ( ) ) $$ | Shift S |
| 0S1 ( 2 | [ ] ( [ ] ) ) [ ] ( ( ) ) $$ | Shift ( |
| 0S1 ( 2 | S [ ] ( [ ] ) ) [ ] ( ( ) ) $$ | Reduce by S→ ε |
| 0S1 ( 2 S 4 | [ ] ( [ ] ) ) [ ] ( ( ) ) $$ | Shift S |
| 0S1 ( 2 S 4 [ 3 | ] ( [ ] ) ) [ ] ( ( ) ) $$ | Shift [ |
| 0S1 ( 2 S 4 [ 3 | S ] ( [ ] ) ) [ ] ( ( ) ) $$ | Reduce by S→ ε |
| 0S1 ( 2 S 4 [ 3 S 5 | ] ( [ ] ) ) [ ] ( ( ) ) $$ | Shift S |
| 0S1 ( 2 | ( [ ] ) ) [ ] ( ( ) ) $$ | Shift and reduce by S→ S [ S ] |
| 0S1 ( 2 | S ( [ ] ) ) [ ] ( ( ) ) $$ | Reduce by S→ ε |
| 0S1 ( 2 S 4 | ( [ ] ) ) [ ] ( ( ) ) $$ | Shift S |
| 0S1 ( 2 S 4 ( 2 | [ ] ) ) [ ] ( ( ) ) $$ | Shift ( |
| 0S1 ( 2 S 4 ( 2 | S [ ] ) ) [ ] ( ( ) ) $$ | Reduce by S→ ε |
| 0S1 ( 2 S 4 ( 2 S 4 | [ ] ) ) [ ] ( ( ) ) $$ | Shift S |
| 0S1 ( 2 S 4 ( 2 S 4 [ 3 | ] ) ) [ ] ( ( ) ) $$ | Shift [ |
| 0S1 ( 2 S 4 ( 2 S 4 [ 3 | S ] ) ) [ ] ( ( ) ) $$ | Reduce by S→ ε |
| 0S1 ( 2 S 4 ( 2 S 4 [ 3 S 5 | ] ) ) [ ] ( ( ) ) $$ | Shift S |
| 0S1 ( 2 S 4 ( 2 | ) ) [ ] ( ( ) ) $$ | Shift and reduce by S→ S [ S ] |
| 0S1 ( 2 S 4 ( 2 | S ) ) [ ] ( ( ) ) $$ | Reduce by S→ ε |
| 0S1 ( 2 S 4 ( 2 S 4 | ) ) [ ] ( ( ) ) $$ | Shift S |
| 0S1 ( 2 | ) [ ] ( ( ) ) $$ | Shift and reduce by S→ S ( S ) |
| 0S1 ( 2 | S ) [ ] ( ( ) ) $$ | Reduce by S→ ε |
| 0S1 ( 2 S 4 | ) [ ] ( ( ) ) $$ | Shift S |
| 0 | [ ] ( ( ) ) $$ | Shift and reduce by S→ S ( S ) |
| 0 | S [ ] ( ( ) ) $$ | Reduce by S→ ε |
| 0S1 | [ ] ( ( ) ) $$ | Shift S |
| 0S1 [ 3 | ] ( ( ) ) $$ | Shift [ |
| 0S1 [ 3 | S ] ( ( ) ) $$ | Reduce by S→ ε |
| 0S1 [ 3 S 5 | ] ( ( ) ) $$ | Shift S |
| 0 | ( ( ) ) $$ | Shift and reduce by S→ S [ S ] |
| 0 | S ( ( ) ) $$ | Reduce by S→ ε |
| 0S1 | ( ( ) ) $$ | Shift S |
| 0S1 ( 2 | ( ) ) $$ | Shift ( |
| 0S1 ( 2 | S ( ) ) $$ | Reduce by S→ ε |
| 0S1 ( 2 S 4 | ( ) ) $$ | Shift S |
| 0S1 ( 2 S 4 ( 2 | ) ) $$ | Shift ( |
| 0S1 ( 2 S 4 ( 2 | S ) ) $$ | Reduce by S→ ε |
| 0S1 ( 2 S 4 ( 2 S 4 | ) ) $$ | Shift S |
| 0S1 ( 2 | ) $$ | Shift and reduce by S→ S ( S ) |
| 0S1 ( 2 | S ) $$ | Reduce by S→ ε |
| 0S1 ( 2 S 4 | ) $$ | Shift S |
| 0 | $$ | Shift and reduce by S→ S ( S ) |
| 0 | S $$ | Reduce by S→ ε |
| 0S1 | $$ | Shift S |
| 0 | P | Shift and reduce by S→ S ( S ) |
| [done] |
Want to see more full solutions like this?
Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
2. Consider the following pseudocode for partition:
function partition (A,L,R)
pivotkey = A [R]
t = L
for i
L to R-1 inclusive:
if A[i] A[i]
t = t + 1
end if
end for
A [t] A[R]
return t
end function
Suppose we call partition (A,0,5) on A=[10,1,9,2,8,5]. Show the state of the list at the
indicated instances.
Initial A
After i=0 ends
After 1 ends
After i 2 ends
After i = 3 ends
After i = 4 ends
After final swap
10 19 285
[12 pts]
.NET Interactive
Solving Sudoku using Grover's Algorithm
We will now solve a simple problem using Grover's algorithm, for which we do not necessarily know the solution beforehand. Our problem is a 2x2 binary sudoku, which in our case has two simple rules:
•No column may contain the same value twice
•No row may contain the same value twice
If we assign each square in our sudoku to a variable like so:
1
V V₁
V3
V2
we want our circuit to output a solution to this sudoku.
Note that, while this approach of using Grover's algorithm to solve this problem is not practical (you can probably find the solution in your head!), the purpose of this example is to demonstrate the
conversion of classical decision problems into oracles for Grover's algorithm.
Turning the Problem into a Circuit
We want to create an oracle that will help us solve this problem, and we will start by creating a circuit that identifies a correct solution, we simply need to create a classical function on a quantum circuit
that…
using r language
Chapter 2 Solutions
Programming Language Pragmatics, Fourth Edition
Ch. 2.1 - Prob. 1CYUCh. 2.1 - Prob. 2CYUCh. 2.1 - Prob. 3CYUCh. 2.1 - Prob. 4CYUCh. 2.1 - Prob. 5CYUCh. 2.1 - Prob. 6CYUCh. 2.1 - Prob. 7CYUCh. 2.1 - Prob. 8CYUCh. 2.1 - Prob. 9CYUCh. 2.2 - Prob. 10CYU
Ch. 2.2 - Prob. 11CYUCh. 2.2 - Prob. 12CYUCh. 2.2 - Prob. 13CYUCh. 2.2 - Prob. 14CYUCh. 2.2 - Prob. 15CYUCh. 2.2 - Prob. 16CYUCh. 2.2 - Prob. 17CYUCh. 2.2 - Prob. 18CYUCh. 2.2 - Prob. 19CYUCh. 2.3 - Prob. 20CYUCh. 2.3 - Prob. 21CYUCh. 2.3 - Prob. 22CYUCh. 2.3 - Prob. 23CYUCh. 2.3 - Prob. 24CYUCh. 2.3 - Prob. 25CYUCh. 2.3 - Prob. 26CYUCh. 2.3 - Prob. 27CYUCh. 2.3 - Prob. 28CYUCh. 2.3 - Prob. 29CYUCh. 2.3 - Prob. 30CYUCh. 2.3 - Prob. 31CYUCh. 2.3 - Prob. 32CYUCh. 2.3 - Prob. 33CYUCh. 2.3 - Prob. 34CYUCh. 2.3 - Prob. 35CYUCh. 2.3 - Prob. 36CYUCh. 2.3 - Prob. 37CYUCh. 2.3 - Prob. 38CYUCh. 2.3 - Prob. 39CYUCh. 2.3 - Prob. 40CYUCh. 2.3 - Prob. 41CYUCh. 2.3 - Prob. 42CYUCh. 2.3 - Prob. 43CYUCh. 2.3 - Prob. 44CYUCh. 2 - Prob. 3ECh. 2 - Prob. 4ECh. 2 - Prob. 5ECh. 2 - Prob. 9ECh. 2 - Prob. 10ECh. 2 - Prob. 11ECh. 2 - Prob. 12ECh. 2 - Prob. 13ECh. 2 - Prob. 14ECh. 2 - Prob. 15ECh. 2 - Prob. 16ECh. 2 - Prob. 17ECh. 2 - Prob. 18ECh. 2 - Prob. 19ECh. 2 - Prob. 20ECh. 2 - Prob. 24ECh. 2 - Prob. 26ECh. 2 - Prob. 27ECh. 2 - Prob. 28ECh. 2 - Prob. 38EQCh. 2 - Prob. 40EQ
Knowledge Booster
Similar questions
- 8. Cash RegisterThis exercise assumes you have created the RetailItem class for Programming Exercise 5. Create a CashRegister class that can be used with the RetailItem class. The CashRegister class should be able to internally keep a list of RetailItem objects. The class should have the following methods: A method named purchase_item that accepts a RetailItem object as an argument. Each time the purchase_item method is called, the RetailItem object that is passed as an argument should be added to the list. A method named get_total that returns the total price of all the RetailItem objects stored in the CashRegister object’s internal list. A method named show_items that displays data about the RetailItem objects stored in the CashRegister object’s internal list. A method named clear that should clear the CashRegister object’s internal list. Demonstrate the CashRegister class in a program that allows the user to select several items for purchase. When the user is ready to check out, the…arrow_forward5. RetailItem ClassWrite a class named RetailItem that holds data about an item in a retail store. The class should store the following data in attributes: item description, units in inventory, and price. Once you have written the class, write a program that creates three RetailItem objects and stores the following data in them: Description Units in Inventory PriceItem #1 Jacket 12 59.95Item #2 Designer Jeans 40 34.95Item #3 Shirt 20 24.95arrow_forwardFind the Error: class Information: def __init__(self, name, address, age, phone_number): self.__name = name self.__address = address self.__age = age self.__phone_number = phone_number def main(): my_info = Information('John Doe','111 My Street', \ '555-555-1281')arrow_forward
- Find the Error: class Pet def __init__(self, name, animal_type, age) self.__name = name; self.__animal_type = animal_type self.__age = age def set_name(self, name) self.__name = name def set_animal_type(self, animal_type) self.__animal_type = animal_typearrow_forwardTask 2: Comparable Interface and Record (10 Points) 1. You are tasked with creating a Java record of Dog (UML is shown below). The dog record should include the dog's name, breed, age, and weight. You are required to implement the Comparable interface for the Dog record so that you can sort the records based on the dogs' ages. Create a Java record named Dog.java. name: String breed: String age: int weight: double + toString(): String > Dog + compareTo(otherDog: Dog): int > Comparable 2. In the Dog record, establish a main method and proceed to generate an array named dogList containing three Dog objects, each with the following attributes: Dog1: name: "Buddy", breed: "Labrador Retriever", age: 5, weight: 25.5 Dog2: name: "Max", breed: "Golden Retriever", age: 3, weight: 30 Dog3: name: "Charlie", breed: "German Shepherd", age: 2, weight: 22 3. Print the dogs in dogList before sorting the dogList by age. (Please check the example output for the format). • 4. Sort the dogList using…arrow_forwardThe OSI (Open Systems Interconnection) model is a conceptual framework that standardises the functions of a telecommunication or computing system into seven distinct layers, facilitating communication and interoperability between diverse network protocols and technologies. Discuss the OSI model's physical layer specifications when designing the physical network infrastructure for a new office.arrow_forward
- In a network, information about how to reach other IP networks or hosts is stored in a device's routing table. Each entry in the routing table provides a specific path to a destination, enabling the router to forward data efficiently across the network. The routing table contains key parameters determining the available routes and how traffic is directed toward its destination. Briefly explain the main parameters that define a routing entry.arrow_forwardYou are troubleshooting a network issue where an employee's computer cannot connect to the corporate network. The computer is connected to the network via an Ethernet cable that runs to a switch. Suspecting a possible layer 1 or layer 2 problem, you decide to check the LED status indicators on both the computer's NIC and the corresponding port on the switch. Describe five LED link states and discuss what each indicates to you as a network technician.arrow_forwardYou are a network expert tasked with upgrading the network infrastructure for a growing company expanding its operations across multiple floors. The new network setup needs to support increased traffic and future scalability and provide flexibility for network management. The company is looking to implement Ethernet switches to connect various devices, including workstations, printers, and IP cameras. As part of your task, you must select the appropriate types of Ethernet switches to meet the company's needs. Evaluate the general Ethernet switch categories you would consider for this project, including their features and how they differ.arrow_forward
- You are managing a Small Office Home Office (SOHO) network connected to the Internet via a fibre link provided by your Internet Service Provider (ISP). Recently, you have noticed a significant decrease in Internet speed, and after contacting your ISP, they confirmed that no issues exist on their end. Considering that the problem may lie within your local setup, identify three potential causes of the slow Internet connection, focusing on physical factors affecting the fibre equipment.arrow_forwardYour organisation has recently installed a new network in a building it has acquired. As the network administrator, you have set up a dedicated telecommunications room to house all the rack-mounted servers, switches, and routers. To ensure optimal performance and longevity of the equipment, you need to monitor certain environmental factors in the room. Identify the environmental factors that should be monitored and explain why each is important to maintain the proper functioning of the telecommunications equipment.arrow_forwardYour organisation is preparing to move into a newly constructed office building that has never been occupied or wired for network services. As the network administrator, your manager has tasked you with designing a structured cabling plan that will support data, voice, and other network services across all building floors. The cabling plan must account for future expansion, efficient data transmission, and compliance with industry standards. Identify and explain the different subsystems you would include in the structured cabling scheme, following the ANSI/TIA/EIA 568 standard.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education