Info
Warning
Danger
/ Homework Answers / Computer Science / Question 1. Use recursion method to define grammar inductively, 2. Use semantic

Question : Question 1. Use recursion method to define grammar inductively, 2. Use semantic

Question

1. Use recursion method to define grammar inductively,

2. Use semantic meanning for non-terminals method

for the following language:

strings have equal numbers of x and y. For example your language will accept following strings xy, xyxy, xyxyxy, xxxyyy, xxyxyy, but will reject xyx, xxxyy, xxy, yyxxx, ... .

Also show that grammar you created is ambiguos or not by using parse tree approach.

_______________________________________________________________________________________________

Develop a context-sensitive grammar that generates the language  

                          L = { in jm kn lm | n, m 1}

Show the derivation of string "iijjjkklll" using your CSG grammar.

 

Solution
5 (1 Ratings )

Solved
Computer Science 4 Months Ago 8 Views
This Question has Been Answered!
Premium Content -

Unlimited Access

Explore More than 2 Million+
  • Textbook Solutions
  • Flashcards
  • Homework Answers
  • Documents
Signup for Better Grades!

Ask an Expert

Our Experts can answer your tough homework and study questions
154049 Computer Science Questions Answered!
Post a Question