Ask Question, Ask an Expert


Ask Computer Engineering Expert

problem 1: Given the production:

S-> aSAb | Ab
A-> bbb
implement a complete pseudo code for a recursive descent parser. Assume scanner ( ) returns the next token.

problem 2: Give all needed first and follow sets needed to check if the grammar is LL(1). Is it?:

S -> aA | BB
A -> aaA | empty
B -> bB | Cd
C -> cA | dC

problem 3: A function returns a number, takes no arguments, and its body is a block. Functions are defined exactly like variables in the grammar except that function name is follow by a block. Show the grammar. Is the resulting grammar LL(1)?

problem 4: A function definition must be before the program token, and functions cannot be nested (exactly like in C). Every function has a return type (no void) and one argument. Function call is like in C, with an expression for the argument and the function call itself is an expression. Show the grammar. exs:

int fun1(long x)
/* same as in any block*/
long fun2(int x)
/** ... */
program xxx(void)
int x;

problem 5: Design unambiguous grammar to parse expressions involving +, -, *, / and unary -. Unary minus is strongest, followed by * and /(same precedence, right associative), then +, left associative, then finally -, left associative. Do not use any other operators, and use only number tokens.

problem 6: Assume function f ( ) has local variables a, b, and function g is nested inside of f ( ) and has local variable a. There is also a global variable c.

a) show the complete memory space for the program when it begins execution
b) show the stack after f ( ) is called, which subsequently calls g ( ), which calls itself once.
c) assume we have three statements in g ( )

stat1: c=10;
stat2: a=20;
stat3: b=30;
how would they be translated by the compiler: describe in words.

problem 7: Show the grammar for:

a) Allow global variables placed just before the first begin – these variables are optional and are listed separated by commas. For ex:

int x,y,z;
begin {etc.}

b) Also allow functions. Each function takes any number of arguments and always returns an integer. Parameter list is C-like, and the return statement (followed by an expression) is mandatory. Functions can be called in place of any expression. Functions are defined with a block, which is the same as the begin-end block in our grammar. Functions are defined separately, as in C but before the main program. Assume we have a multi-pass compiler so that prototypes is not an issue. The following is an ex program

int sum(int a, b) {paramater list is same as for globals}
int c;
return a+b;
int x,y;

problem 8: Given the program (like Pascal, with nested functions)

int x, y; {global}
function A
int z; {z is in A}
function B {B is defined inside A}
int x; {x is in B}
function C {C is inside B}
int x; {x is in C}
C(); {recursive call on C}
end; {end of C}
end; {end of B}
B(); { A calls B}
end; {end of A}

a) show ARs (activation Records) for A, B, C (show only local data, static and dynamic link}
b) What is in the persistent data space?
c) assume call to A() is done somewhere. Then, show that contents of the stack during the 3rd recursive call to C(). Make sure to fill out all info on the stack.
d) How would the left-hand-side variables in C()be translated by the compiler (describe in words, separately for each variable).

problem 9: Given the grammar, with lower case terminals and upper case nonterminals, and S the initial nonterminal

S -> aS | aA | bA
A -> Aa | ABb | cA
B -> bB | bdB | c

a) remove left recursion as needed, showing the modified grammar

b) left-factorize as needed what you get in a), showing the new grammar

c) Is the resulting grammar LL(1)? Argue piece by piece why it is or why it is not, showing all (and only the necessary) First and Follow sets.

problem 10: Assume the following static program structure, show the static chains and display when exactly five ARs are on the stack, assuming procedure A is called first.

proc A
begin /* proc A */
proc B
begin /* proc B */
proc C
begin /* proc C */
call A
end /* proc C */
call C
end /* proc B */
proc D
begin /* proc D */
call B
end /* proc D */
call D
end /* proc A */

Computer Engineering, Engineering

  • Category:- Computer Engineering
  • Reference No.:- M93892

Have any Question? 

Related Questions in Computer Engineering

Design and implement an algorithm that performs insertions

Design and implement an algorithm that performs insertions and deletions on a doubly linked list. In a doubly linked list each node has two pointers (except at the head and tail), one to its successor and one to its pred ...

1 given an unsorted list of n values what is the

1. Given an unsorted list of n values, what is the time-complexity to find the k t h smallest value in the worst case? What would be the complexity if the list were sorted? 2. What is the O(·) for the findSortedPosition( ...

1 what is tombstoning and why use it2 discuss in detail

1. What is tombstoning and why use it? 2. Discuss in detail Idle Detection in Windows Phone 8 Applications. 3. Discuss in detail the software input panel (SIP). 4. Discuss Data Binding. 5. Discuss the Windows Phone Toolk ...

Individual visual logic calculationsselect two calculation

Individual: Visual Logic: Calculations? Select two calculation tasks that a program could perform that could be used by a small business. Each task must include the following: • Inputting a value • Performing a calculati ...

Write a deletion method for the avltree class that utilizes

Write a deletion method for the AVLTree class that utilizes lazy deletion. There are several techniques you can use, but a simple one is to simply add a Boolean field to the Node class that signifies whether or not the n ...

Presentations and best practices please respond to the

Presentations and Best Practices" Please respond to the following: • Choose a field (e.g., marketing, sales, teaching, etc.) where you believe presentations are important. Describe three ways in which you could effective ...

Ups system integration challengesafter you have read the

UPS system integration challenges After you have read the case study, answer the following questions: 1. What are some of the system integration challenges faced by UPS? 2. Discuss the systems integration solutions at UP ...

1 in a tcp connection the window size fluctuates between

1. In a TCP connection, the window size fluctuates between 60,000 bytes and 30,000 bytes. If the average RTT is 30 ms, what is the throughput of the connection? 2. If originally RTTS = 14 ms and α is set to 0.2, calculat ...

1 assume a destination computer receives several packets

1. Assume a destination computer receives several packets from a source. How can it be sure that the fragments belonging to a datagram are not mixed with the fragments belonging to another datagram? 2. Explain why the In ...

Lab assignmentsmethodsobjectivesin this lab assignment

Lab Assignments Methods Objectives In this lab assignment, students will learn: - How to define methods and functions - How to call methods or functions - How to specify parameters and how to pass arguments by value Goal ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

WalMart Identification of theory and critical discussion

Drawing on the prescribed text and/or relevant academic literature, produce a paper which discusses the nature of group

Section onea in an atwood machine suppose two objects of

SECTION ONE (a) In an Atwood Machine, suppose two objects of unequal mass are hung vertically over a frictionless

Part 1you work in hr for a company that operates a factory

Part 1: You work in HR for a company that operates a factory manufacturing fiberglass. There are several hundred empl

Details on advanced accounting paperthis paper is intended

DETAILS ON ADVANCED ACCOUNTING PAPER This paper is intended for students to apply the theoretical knowledge around ac

Create a provider database and related reports and queries

Create a provider database and related reports and queries to capture contact information for potential PC component pro