Answered: (b) L2 = {a"b™ci de:n+ m = k + l} %3|…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

give context-free grammar for the following languages.

please do this in a single.

(b) L2 = {a"b"c*d² : k + e}
= k + l}
n + m
(c) L3 = {w : na(w) > ng(uw) + 1}

Expert Solution

Step 1

For the given Language $L_{1}$

Production rules are

$S_{1} \to {aS}_{1} d | S_{2} S_{2} \to S_{3} S_{4} S_{3} \to {aS}_{3} b | ε S_{4} \to S_{5} S_{6}$

$S_{5} \to {bS}_{5} c | ε S_{6} \to {cS}_{6} d | ε$

Grammar is

CFG{N,T,P,S} = {{ $S_{1}, S_{2}, S_{3}, S_{4}, S_{5}, S_{6}$ }, {a,b,c,d}, { $S_{1} \to {aS}_{1} d | S_{2} S_{2} \to S_{3} S_{4} S_{3} \to {aS}_{3} b | ε S_{4} \to S_{5} S_{6}$ $S_{5} \to {bS}_{5} c | ε S_{6} \to {cS}_{6} d | ε$ }, { $S_{1}$ }}

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions