tags:

views:

41

answers:

0
Q: 

Context-free grammar(CFG) & Recursive descent parser(RDP) for id:=expression

Write a Context-free grammar(CFG) that pass all assignment statements of the form id:=expression where expression is an arithmetic expression involving integers,real numbers,identifiers,operators like +,_,*,/,%,^ and parenthesis().use to construct Recursive descent parser(RDP) for the same.

related questions

What would be the simplest way to alpha sort an array of chars in C?
Failed software development
When does ++ not produce the same results as +1?
Shortest Root to Leaf Path
Repository Pattern Implementation Experience
Algorithm to detect similar documents in python script
Separation of Concerns
Creating a java servlet web application
How do you solve the 15-puzzle with A-Star or Dijkstra's Algorithm?
Algorithm to find which numbers from a list of size n sum to another number
software Engineering documentation
What is round-robin scheduling?
What is a multitasking operating system?
How do I clip a line segment against a frustum?
How do I capitalize first letter of first name and last name in C#?
Why is quicksort better than mergesort?
Hidden Markov Models
Using Stack as Queue
Database design for a booking application e.g. hotel
What is a good algorithm for deciding whether a passed in amount can be built additively from a set of numbers?
How to identify specific digits of an integer input in C?
Interesting interview questions
Print Odd-Even numbers using signals
What is the best way to learn recursion?
Are foreign keys really necessary in a database design?