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

In this project, you will develop algorithms that find road routes through the bridges to travel between islands. The input is a text file containing data about the given map. Each file begins with the number of rows and columns in the map considered as maximum latitudes and maximum longitudes respectively on the map. The character "X" in the file represents the water that means if a cell contains "X" then the traveler is not allowed to occupy that cell as this car is not drivable on water. The character "0" in the file represents the road connected island. That means if a cell contains "0" then the traveler is allowed to occupy that cell as this car can drive on roads. The traveler starts at the island located at latitude = 0 and longitude = 0 (i.e., (0,0)) in the upper left comer, and the goal is to drive to the island located at (MaxLattitude-1, MaxLongitudes-1) in the lower right corner. A legal move from an island is to move left, right, up, or down to an immediately adjacent cell…
1. Using the above class map, write function void map::mapToGraph(graph &g){...} to create a graph g that represents the legal moves in the map m. Each vertex should represent a cell, and each edge should represent a legal move between adjacent cells. 2. Write a recursive function findPathRecursive(graph &g, stack &moves) that looks for a path from the start island to the destination island. If a path from the start to the destination exists, your function should call the map::printPath() function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If no path from the start to the destination exists, the program should print, "No path exists". If a solution exists the solver should also simulate the solution to each map by calling the map::print() function. The map::print() function prints out a map visualization, with the goal and current position of the car in the map at each move, marked to show the progress. Hint: consider recursive-DFS. 3.…
Write a C++ class called BSTArray with five basic functions for the BST: insert, search, findmin, findmax, and print: 1. int search(x): Find and return the index that stores element x using binary search tree mechanism. Print out all the elements in the search path. You must use the binary tree search algorithm. In other words, do NOT just do a linear search of the array. If the x value is not found, report an error and return -1. 2. int findmax( ): Find and return maximum value in BST. You must use the binary tree search algorithm. In other words, do NOT just perform a linear search of the array. If the tree is empty, return -1. 3. int findmin( ): Find and return minimum value in BST. In other words, do NOT just perform a linear search of the array. If the tree is empty, return -1. 4. void print( ): Print out the BST structure in the form of an array with index. Specifically, print the index of the array and the value stored at that index starting at zero and ending at the capacity of…
Write a menu-based program that implement simple binary Search Tree and write the following functions for that: 1.Write a function Add () that add a single leaf on each call according to BST. 2. Write function Delete () that delete the provided value on each call if exist.3.Write function In order () to display list of all nodes using in order traversing technique.4.Wire function Preorder () to display list of all nodes using preorder traversing technique.5.Wire function Post order () to display list of all nodes using post order traversing technique.
Write a recursive Java function displayOutIn that displays two items from an array list at one instance from out-to-in. until one or last two items displayed and the process stops. For example, given array A = {15, 74, 106, 10, 9, 86, 34} the displayOutIn function displays the following: 15, 34 74, 86 106, 9 10
A- Declare a self-referential structure for a linked list having one data StudentNode field called GPA (float), and one pointer to StudentNode called next. B- Write a non-recursive function - that counts all the GPAS that are less than or equal to 2 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should return 3. C- Write a recursive function that prints all the GPAS that are higher or equal to 3.5 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should print: 3.5->4.
PLEASE WRITE IN C++ Implement a program that uses an array based binary tree (sequential tree) that has a menu with these options: 1.) insert (This option asks the user for a size and then creates the array based tree, filling the tree with characters or integers . Fill the sequential tree as a complete tree and insert keys as children to specific parents, It is also straightforward to insert children to specific parents due to the fixed nature of the parent child relationship, with a parent having children at indexes ( 2 * Parent index ) + 1, and + 2.). 2.) search (asks user for a character to search in the tree then prints if it is in the tree or not.) 3.) quit (exits program)
Please implement the follwoing problem in C++: Implement a symbol balance checker function for the Pascal programming language. Pascal allows for the following pairs: {}, (), [], begin end . All programs will begin with the word "begin" and end with the word "end". Your function should receive an ifstream object which is already open and will return true, all of the symbols match, or false, they do not. You do not have to worry about comments in the program but you do have to avoid other parts of the program's code such as assignment statements (x=y) and other expressions.
Haskell Textbook: "Programming in Haskell, 2ndEd.", by Graham Hutton Programming in Haskell: data Tree a b = Leaf a | Branch b (Tree a b) (Tree a b) Implement the three functions that traverse the tree inthe given order collecting the values from the tree nodes into a list:preorder :: (a -> c) -> (b -> c) -> Tree a b -> [c]inorder :: (a -> c) -> (b -> c) -> Tree a b -> [c]postorder :: (a -> c) -> (b -> c) -> Tree a b -> [c] Also, show how each of your three functions work step-by-step with the following tree object.tree1 :: Tree Int Stringtree1 = Branch "+"(Branch "*"(Leaf 3)(Branch "+" (Leaf 4) (Leaf 5)))(Branch "+"(Branch "*" (Leaf 6) (Leaf 7))(Leaf 8))Notice that the data type Tree can store different types of values in the leaves than onthe branching nodes. Thus, each of these functions takes two functions as arguments: Thefirst function maps the values stored in the leaves to some common type c, and the secondfunction maps the values…
Write a program in c++ which should create a weighted graph of the values entered by the user andthen write functions that perform the following: 1. Depth first search of source and destination vertex2. Breadth first search of source and destination vertex3. Shortest path search of source and all destination vertices (Dijkstra’s algorithm)4. Shortest path search of source and destination vertex (Dijkstra’s algorithm) The program should present a menu of the options and should run until the user opts to quit.
Write a function in c programming language that gets an array of points ( function is defined as : typedef struct{ int x; Int y; } point; ) and sorts the array using qsort().Given two points a=(ax,ay) and b=(bx,by) we compare them as follows: 1) if (ax)2+(ay)2 < (bx)2+(by)2, then a should come before b in the sorted array. 2) if (ax)2+(ay)2 = (bx)2+(by)2, then we compare the points by the x coordinate. Remark: For a point a=(ax,ay) the quantity ((ax)2+(ay)2)1⁄2 is the distance of a from the (0,0). That is, we sort the points according to their distance to (0,0), and if for points at the same distance, then we sort them according to the first coordinate. You will need to implement the comparison function, and apply qsort() on the array with this comparison function. For example: - Input: [(3,2), (7,1), (1,1), (3,4), (5,0), (7,1)] - Expected output: [(1,1), (3,2), (3,4), (5,0), (7,1), (7,1) ] Explanation:(1,1) is first because 12+12=2 is the smallest(3,2)…
Write a recursive function, OnlyChild(..), that returns the number of nodes in a binary tree that has only one child. Consider binaryTrecNode structure is defined as the following. struct binaryTreeNode int info; binaryTreeNode *llink; binaryTreeNode *rlink; The function is declared as the following. You ust write the function as a recursive function. You will not get any credits if a non-recursive solution is used. int OnlyChild(binaryTreeNode *p); For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). B IUS Paragraph Arial 10pt 11