5-Write an EBNF rule that describes the following statement of Java. Then, write the recursive-descent subprogram in Java for the EBNF rule. Please summit your source code and a screen shot of the parsing of the following examples. do{ if (number< 10 ) number1++; else if (number <20) number2++; else number3++; count++; } while (count < 50)

5-Write an EBNF rule that describes the following statement of Java. Then, write the recursive-descent subprogram in Java for the EBNF rule. Please summit your source code and a screen shot of the parsing of the following examples. do{ if (number< 10 ) number1++; else if (number <20) number2++; else number3++; count++; } while (count < 50)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 12PE

See similar textbooks

Similar questions

Recursive Exponentiation (using c language) Write a recursive function power(base, exponent) that when invoked returns baseexponent. For example, power(3, 4) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than or equal to 1. Then, write a demo program that uses the power function and test it out for a number of inputs. Hint: The recursion step would use the relationship baseexponent = base * baseexponent–1 and the terminating condition occurs when exponent is equal to 1 because base1 = base
def height(words, word): The length of a word is easy enough to define by tallying up its characters. Taking the road less traveled, we define the height of the given word with a recursive rule for the height of the given word to follow from the heights of two words whose concatenation it is. First, any character string that is not one of the actual words automatically has zero height. Second, an actual word that cannot be broken into a concatenation of two nonempty actual words has the height of one. Otherwise, the height of an actual word equals one plus the larger of the heights of the two actual words whose combined concatenation it can be expressed as. To make these heights unambiguous for words that can be split into two non-empty subwords in multiple ways, this splitting is done the best way that produces the tallest final height. Since the list of words is known to be sorted, you can use binary search (available as the function bisect_left in the bisect module) to quickly…
Write a recursive function power( base, exponent ) that when invoked returns baseexponentFor example, power( 3, 4 ) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than orequal to 1. Hint: The recursion step would use the relationship baseexponent = base * baseexponent1and the terminating condition occurs when exponent is equal to1 becausebase1 = base c language
Prolog The sequence of Pell numbers 0,1,2,5,12,29,70,169,408,.. can be defined recursively as the sequence of numbers in which the first two numbers are 0 and 1, and each subsequent number is given by adding 2 times the preceding number to the number which precedes this. This can be defined in Haskell as: pell :: Int -> Int pell 0 = 0 pell 1 = 1 pell n = 2 * pell (n-1) + pell (n-2) Formulate the appropriate Prolog predicate "pell(N,Pn)" which is true if (and only if) "Pn" is the "N"-th term of the sequence of Pell numbers (note that we start numbering the sequence of Pell numbers with 0). That is, "pell(8,408)." would evaluate to "true", or "pell(5,Pn)." would give "Pn = 29"
Write an EBNF rule that describes the for-statement of Java or C++. Write the recursive descent subprogram in Java or C++ for this rule.
Java C++ Write a recursive function that accepts two arguments into the parameters x and y. The function should return the value of x times y. Remember, multiplication can be performed as repeated addition: 7∗4=4+4+4+4+4+4+47 * 4=4+4+4+4+4+4+47∗4=4+4+4+4+4+4+4
Each regular expression r denotes a language L(r), which is also defined recursively from the languages denoted by r ′s subexpressions. Write the language denoted by the following regular expressions:(i) a |a*b (ii) a(a | b)* (iii) (a | b)*ab (iv) a | b
(C Language) Write a recursive function called DigitCount() that takes a non-negative integer as a parameter and returns the number of digits in the integer. Hint: The digit count increases by 1 whenever the input number is divided by 10.
in java Computing Powers, p(x,n)=xn1. Describe the definition of recursive function.oBase case(s)oRecursive case(s)2. Write the code
Solve in Java please. Give a recursive definition for each of the problems stated below. For each problem clearly state the base case(s) and the recursive case(s). You do not need to implement these definitions in Java. exp(x,n) = xn , where both x and n are non-negative integers. E.g. exp(2,5) = 32 Assume we have a programming language that only allows conditionals (i.e. if statements), operations for +1 and -1, and recursive calls. How could the following function be defined recursively in that language? add(a,b) = a + b both a and b are non-negative integers. E.g. add(5, 7) = 12
Remove indirect recursion A---->aA | Ab | Bab | C | d B---->AC | Ad | C C----> Ad | d
In a game called FictionalGame the players can be either be individuals or teams; team members are in turn players, that can be either individuals or teams, and so on, in an unusual (for games) recursive structure. In the UML class diagram below (left) you see how this is modelled with the Composite pattern. In an example instance of FictionalGame you have the team Eagles composed by the members Joe (individual), Ann (individual) and Skylarks (team). The team Skylarks is composed by Mary (individual) and Robins (team). The team Robins is composed by Mark (individual). This is depicted in the UML object diagram below (right). State whether we could possibly have, in some object diagram, an object of the class Player, justifying your answer. Suppose you have an operation print(String) with which you can print a string; to print the attribute name of Individual, for example, you call print(name) (pseudo-code). Write in pseudo-code the specification of the operation printname() of Team,…