Compiler Design Tell how lexical analyser would separate the following statement into tokens: a) a[i] = j++ * --i; b) a
Posted: Thu Jun 02, 2022 8:16 am
Compiler Design
Tell how lexical analyser would separate the
following statement into tokens:
a) a = j++ * --i;
b) a[i*N+j] = i+j;
c) a[i*10+j] = i+j;
d) a = j++ * i--;
Tell how lexical analyser would separate the
following statement into tokens:
a) a = j++ * --i;
b) a[i*N+j] = i+j;
c) a[i*10+j] = i+j;
d) a = j++ * i--;