Question

Write down the steps that how lexical analyzer will transform the following
code into Tokens. Explain the following code through Regular expressions, Regular
expressionsto NFA, NFA to DFA and DFA minimization.
// C++ Program to display all elements
// of an initialized two dimensional array
#include
using namespace std;
int main() {
int test[3][2] = {{2, -5},
{4, 0},
{9, 1}};
// use of nested for loop
// access rows of the array
for (int i = 0; i < 3; ++i) {
// access columns of the array
for (int j = 0; j < 2; ++j) {
cout << "test[" << i << "][" << j << "] = " << test[i][j] << endl;
}
}
return 0;
}

Answer 1

Answer:

sorry yaar

Explanation:

ans nhi pata mujhe