write a java code:Consider the following expression BNF: ::= * | / | :== + | - | ::= { }| :: 0|1|2|3|4|5|6|7|8|9Using recursive descent, and only recursive descent, scan expressions that adhere to this BNF to build their expression tree;write an integer valued function that scans the tree to evaluate the expression represented by the tree.Input:A numeric expression adhering to this BNF.Output:Some representation of the expression tree.The result of evaluating the expression.write a java code for it.

1. Receive a user-entered arithmetic expression. 2. Parsing:- Initialize a parser object using the…

Answered: write a java code: Consider the…

Engineering

Computer Science

write a java code: Consider the following expression BNF: ::= * | / | :== + | - ::= { }|

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

write a pseudocode for this programme in c++ #include<iostream> #include<string.h> using namespace std; struct staff_info { char name[40]; int noIC; int age; int category; int scheme;};int main(){ struct staff_info staff[10]; for(int i=0;i<10;i++) { cout<<"Enter Name: "; cin>>staff[i].name; cout<<"Enter IC Number: "; cin>>staff[i].noIC; cout<<"Enter Age: "; cin>>staff[i].age; cout<<"Enter Category(Press 1 for Academic / 2 for Non-Academic): "; cin>>staff[i].category; cout<<"Enter Scheme (Press 1 for Pension on 56 years / 2 for Pension on 60 years: "; cin>>staff[i].scheme; } cout<<endl; cout<<"Staff's Information"<<endl; cout<<"Name\t\tNoIC\t\tAge\t\tCategory\t\tScheme"<<endl; for(int i=0;i<10;i++) {…
C++. Explanation please.
Consider the set of following syntax rules. <loop statement> ::= <while loop> <while loop> ::= while ( <condition> ) <condition>::=<identifier><conditionalOperator><identifier> <conditionalOperator>:= >|<|<=|>=|!=|== <identifier>::= <letter>|<letter><identifier> <letter>::= a|b|c|d|e|f|g|h|i|j|k|l|m|n|o|p|q|r|s|t|u|v|w|x|y|z a) The following WHILE loops are intended to be written using the syntax defined by these rules. For each one, state whether it is syntactically correct or incorrect. If it is incorrect, give your reasons. i) while(d<=E) ii) while(b!=6) iii) while(s>q) iv) while(m=r) v) while(x>y) b) Write a BNF definition of hex where hex consists of at least one digit, or at least one letter or a mixture of digits and letters. Hex letters are A, B, C, D, E and F. Here are some of the valid examples for hex: C, CD, FE19, EC128, AB, CAB
Consider the following C++ code segment: int d = 20; int f(int b) { static int c = 0; c *= b; return c; } int main() { int a; cin >> a; cout << f(a) * d << endl; }For each variable a, b, c, d: identify all type bindings and storage bindings for each binding, determine when the binding occurs identify the scope and lifetime
c++
Translate the following C program into NASM. #include <stdio.h> int ary[] = {12, 40, -2, 89, 35, -7, 6}; int main() { int sum = 0; int highest = 0; for (int x = 0; x < 7; x++) { if (highest < ary[x]) highest = ary[x]; sum += ary[x]; } printf("Sum is %d\n", sum); printf("Highest value is %d\n", highest); } Use indexing (the [ebx+esi] or [ebx+edi] form). You can have several “dw” values on the same line. Use the “loop” command.
Format Requirement Algorithms in pseudo code MUST be placed in code blocks/fences, and use either the cpp or java syntax highlighter. Algorithms should follow the pseudo code standard described in handout 1. Your pseudo code should be placed in a code block, for example Algorithm alg_name(a, b) { // A description of the algorithm // input: a - a positive decimal integer; b - an integer // ouput: the sum of a and b c = a + b // or, c <- a + b return c } Do NOT change the template except the answer portion. Formulas and equations should be in math mode using Latex math symbols. Markdown math tutorial: http://tug.ctan.org/info/undergradmath/undergradmath.pdf Ways enter into the math mode in Notion: https://www.notion.so/help/math-equations
9. It is required to write a parser for the grammar below. <source_file> ::= <declarations> <code> <declarations> ::= vars <list_of_variables> ; <list_of_variables> ::= <variable> | <list_of_variables> , <variable> <code> ::= <statements> . <statements> ::= <assignment> | <statements> ; <assignment> <assignment> ::= <variable> := <expression> <expression> ::= <expression> + <term> | <expression> - <term> | <term> <term> ::= <term> * <factor> | <term> / <factor> | <factor> <factor> ::= <number> | <variable>
5. Consider the following code segment of an MPI program and answer the following question. int rank, tag=1; MPI Status Stat; MPI Init(&argc, &argv); MPI Comm rank (MPI_COMM_WORLD, &rank); int x = rank + 1; if (rank } } == 0) { proc = 1; MPI Recv(&x, 1, MPI_INT, proc, tag, MPI_COMM_WORLD, &Stat); x = x + 5; MPI Send (&x, 1, MPI_INT, proc, tag, MPI_COMM_WORLD); x = x + 2* rank; else if (rank proc = 0; MPI Send (&x, 1, MPI_INT, proc, tag, MPI_COMM_WORLD); x = x + 3; == Answer: 1) { MPIR Recv(&x, 1, MPI_INT, proc, tag, MPI_COMM_WORLD, & Stat); x = x + 2* rank; printf("Task %d: Received %d"\n", rank, x); If the above program is run using 3 processors, what is the output? Write down the output that will be shown in the standard output (output generated by the printf statement). I
Consider the following structure definition. Write a C/C++ function that takes an array of struct student with its size and applies a curve system like if the student scored below 50, 1dd 10 points, if it is above 50, add 2 points. The lowest possible mark is 0 and the highest possible mark is 10. struct student{ int ID; int score; void applycurve (struct student a[ ], int size)
change the code to C language #include<stdio.h>#include<conio.h>void menu();void getInput( char &, int & );float getprice( char ch , int n); int main() {char name[20], order[3][20];int table, quantity[3];char ch1,ch2,ch3;int n1,n2,n3;float price=0;float total=0;float pay=0;float change=0;int q1;int q2;int q3;printf ("\t -----------SUNNY CAFE ORDER FORM-----------\n"); printf("\t Customer Name :");scanf("\n%s",&name);printf("\t Table Number :");scanf("\n%d", &table);menu(); printf("\n\t Order 1: ");getInput(ch1, n1);printf("\t Order 1 quantity: ");scanf("%d", &q1);printf("\n");printf("\t Order 2: ");getInput(ch2, n2);printf("\t Order 2 quantity: ");scanf("%d", &q2);printf("\n");printf("\t Order 3: ");getInput(ch3, n3); printf("\t Order 3 quantity: ");scanf("%d", &q3);printf("\n");printf ("\t\t **********************************************\n");printf(" ~SUNNY CAFE~ \n");printf ("\t\t…
Translate the following C program into NASM. #include <stdio.h> int ary[] = {12, 40, -2, 89, 35, -7, 6}; int main() { int sum = 0; int highest = 0; for (int x = 0; x < 7; x++) { if (highest < ary[x]) highest = ary[x]; sum += ary[x]; } printf("Sum is %d\n", sum); printf("Highest value is %d\n", highest); } Use indexing (the [ebx+esi] or [ebx+edi] form). You can have several “dw” values on the same line. Use the “loop” command.