Question

In certain programming languages, comments appear between delimiters such as #and $\#/$. Let Cbe the language of all valid delimited comment strings. A member of Cmust begin with $\#/$and end with $\#/$but have no intervening $\#/$. For simplicity, assume that the alphabet for Cis $\sum =\{a,b,/,\#\}$.

a. Give aDFA that recognizes C.

b. Give a regular expression that generates C.

Short answer

Evaluate all acceptable restricted commented strings inside the language .

Step-by-step solution

Introduction

Evaluate all acceptable restricted commented strings inside the language C .

• A member of C must start with $\text{'}/\#\text{'}$and conclude with $\#/\text{'}$no '$\#/\text{'}$ in between.

• C is represented by the letters $a,b,I,and\#$.

Explanation for (A)

Let M stand for the DFA that understands the language C .

M's state diagram looks like this:

So, here are the DFA that identify the languages of C.

Explanation for (B)

The regular expression that creates language is C.

$/\#(a+b+\backslash )*\#(\#+(a+b\left)\right(a+b+i)*\#)*/$