Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

0.0/40 points (graded) Q1. Consider the following grammar G, where Sis the start symbol S - ABC A 041 01 B 2B2 COC2012 D111D 1

image text in transcribed

0.0/40 points (graded) Q1. Consider the following grammar G, where Sis the start symbol S - ABC A 041 01 B 2B2 COC2012 D111D 1 Which of the following languages is the language of G? OL={ww = 0'1324, where i, j, k >1 and i jor i = k) OL={ww = 01324, where i, j, k 1 and i=jor (i = k and j = 3n, n > 1)} OL= {ww = 0'1:26, where i, j, k > 0 and i =j and i = k} OL= {ww = 0'112k, where i, j, k >1 and i jor (1 kandj 3n+1, n > 0); Q2.1s the following grammar ambiguous? (Here, S is the start symbol.) SaPb Pa PQPI Q+alb Yes, it is ambiguous. No, it is not ambiguous

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Processing Fundamentals Design And Implementation

Authors: KROENKE DAVID M.

1st Edition

8120322258, 978-8120322257

More Books

Students also viewed these Databases questions