5-Write EBNF rules that describes the syntax of the following program. Then, write a recursive-descent program...

Transcribed Image Text:

5-Write EBNF rules that describes the syntax of the following program. Then, write a recursive-descent program in Java or c++ for the EBNF rules. Please submit your source code and a screen shot of the parsing of the following exam- ples. 1 #include<iostream> using namespace std; int main () } int i, j,temp; int a[5] = {10,2,0,43,12}; cout <<"Input list ...\n"; for (i = 0; i<5; i++) { cout <<a[i]<<"\t"; cout<<endl; for (i = 0; i<5; i++) { for(j=i+1; j<5; j++) { if(a[j] = a[i]) { temp = a[i]; } a[i] = a[j]; a[j] = temp; } cout <<"Sorted Element List ...\n"; for (i = 0; i<5; i++) { cout <<a[i]<<"\t"; } return 0; 5-Write EBNF rules that describes the syntax of the following program. Then, write a recursive-descent program in Java or c++ for the EBNF rules. Please submit your source code and a screen shot of the parsing of the following exam- ples. 1 #include<iostream> using namespace std; int main () } int i, j,temp; int a[5] = {10,2,0,43,12}; cout <<"Input list ...\n"; for (i = 0; i<5; i++) { cout <<a[i]<<"\t"; cout<<endl; for (i = 0; i<5; i++) { for(j=i+1; j<5; j++) { if(a[j] = a[i]) { temp = a[i]; } a[i] = a[j]; a[j] = temp; } cout <<"Sorted Element List ...\n"; for (i = 0; i<5; i++) { cout <<a[i]<<"\t"; } return 0;

Answer rating: 100% (QA)

First lets write the EBNF rules for the given program program int main declaration cout Input list loop1 cout Sorted Element List loop2 return 0 decla... View the full answer