InstructionsThe first programming project involves writing a progr.pdf

Instructions
The first programming project involves writing a program that parses, using recursive descent, a
GUI definition language defined in an input file and generates the GUI that it defines. The
grammar for this language is defined below:
In the above grammar, the red symbols are nonterminals, the blue symbols are tokens and the
black punctuation symbols are BNF metasymbols. Among the tokens those in title case are
keywords. The character literals are punctuation tokens.
Below is an explanation of the meaning of some of the symbols in the above productions that
should help you understand the actions that are to be performed when each of the productions is
parsed:
In the window production the string is name that is to appear in the top border of the window and
the two numbers are the width and height of the window
In the production for layout_type that define the grid layout, the first two numbers represent the
number of rows and columns, and the optional next two the horizontal and vertical gaps
In the production for widget that defines a button, the string is the name of the button
In the production for widget that defines a label, the string is text that is to be placed in the label
In the production for widget that defines a text field, the number is the width of the text field
In the production for radio_button, the string is the label of the button
You parser should properly handle the fact that panels can be nested in other panels. Recursive
productions must be implemented using recursion. Lexical and syntactical errors should be
detected and reported (the first error only; after reporting the first error the program must exit
gracefully).
Below is an example of an input file:
Just to give you an idea where that input file came from, the above input file corresponds to the
GUI shown below:
However, please keep in mind that you are NOT required to re-create the GUI that corresponds
to the input file. Instead, you are only required to:
1. Implement a lexer capable of recognizing all the terminal symbols of the grammar
(tokens/lexemes - those in blue)
2. Implement a recursive descent parser that (using the lexer from 1.) will be able to parse the
input file and detect a syntax error (the first one is enough, then the parser should exit gracefully)
3. As a result of parsing the input file, an output file will be generated, reporting the parsing steps
followed by the parser in a manner similar to the one described by Sebesta (10th edition) on
pages 181-186.
Notes:

- You can implement the parser for this grammar in C, C++, Java or C# 9 6 3 8 0
Solution
This is the codes:
calculator.js
calc_array = new Array();
var calcul=0;
var pas_ch=0;
function $id(id)
{
return document.getElementById(id);
}
function f_calc(id,n)
{
if(n=='ce')
{
init_calc(id);
}
else if(n=='=')
{
if(calc_array[id][0]!='=' && calc_array[id][1]!=1)
{
eval('calcul='+calc_array[id][2]+calc_array[id][0]+calc_array[id][3]+';');
calc_array[id][0] = '=';
$id(id+'_result').value=calcul;
calc_array[id][2]=calcul;
calc_array[id][3]=0;
}
}
else if(n=='+-')
{
$id(id+'_result').value=$id(id+'_result').value*(-1);
if(calc_array[id][0]=='=')
{
calc_array[id][2] = $id(id+'_result').value;

calc_array[id][3] = 0;
}
else
{
}
pas_ch = 1;
}
else if(n=='nbs')
{
if($id(id+'_result').value<10 && $id(id+'_result').value>-10)
{
$id(id+'_result').value=0;
}
else
{
$id(id+'_result').value=$id(id+'_result').value.slice(0,$id(id+'_result').value.length-1);
}
{
}
else
{
}
}
else
{
if(calc_array[id][0]!='=' && calc_array[id][1]!=1)
{
eval('calcul='+calc_array[id][2]+calc_array[id][0]+calc_array[id][3]+';');
$id(id+'_result').value=calcul;
calc_array[id][2]=calcul;
calc_array[id][3]=0;

}
calc_array[id][0] = n;
}
if(pas_ch==0)
{
}
else
{
pas_ch=0;
}
document.getElementById(id+'_result').focus();
return true;
}
function add_calc(id,n)
{
if(calc_array[id][1]==1)
{
$id(id+'_result').value=n;
}
else
{
$id(id+'_result').value+=n;
}
{
}
else
{
}
return true;

}
function init_calc(id)
{
$id(id+'_result').value=0;
calc_array[id] = new Array('=',1,'0','0',0);
return true;
}
function key_detect_calc(id,evt)
{
if((evt.keyCode>95) && (evt.keyCode<106))
{
var nbr = evt.keyCode-96;
add_calc(id,nbr);
}
else if((evt.keyCode>47) && (evt.keyCode<58))
{
var nbr = evt.keyCode-48;
add_calc(id,nbr);
}
else if(evt.keyCode==107)
{
f_calc(id,'+');
}
{
f_calc(id,'-');
}
{
f_calc(id,'*');
}
{
f_calc(id,'');
}

{
add_calc(id,'.');
}
{
add_calc(id,'.');
}
{
add_calc(id,'.');
}
{
f_calc(id,'=');
}
{
f_calc(id,'ce');
}
{
f_calc(id,'nbs');
}
{
f_calc(id,'ce');
}
return true;
}
calculator.css
.calculator
{
width:300px;
height:300px;
background-color:#eeeeee;

border:2px solid #CCCCCC;
margin:auto;
padding-left:5px;
padding-bottom:5px;
}
.calculator td
{
height:16.66%;
}
.calc_td_result
{
text-align:center;
}
.calc_result
{
width:90%;
text-align:right;
}
.calc_td_calculs
{
text-align:center;
}
.calc_calculs
{
width:90%;
text-align:left;
}
.calc_td_btn
{
width:25%;
height:100%;
}
.calc_btn
{
width:90%;
height:90%;

font-size:20px;
}
calculator.html
Javascript Calculator

InstructionsThe first programming project involves writing a progr.pdf

Recommended

Recommended

More Related Content

Similar to InstructionsThe first programming project involves writing a progr.pdf

Similar to InstructionsThe first programming project involves writing a progr.pdf (20)

More from nitinarora01

More from nitinarora01 (20)

Recently uploaded

Recently uploaded (20)

InstructionsThe first programming project involves writing a progr.pdf