Extend the BNF in the answer bax below to include: 1. if-then-else-end statements (in addition to the if-then statements it already includes) 2. read statements of the form read i that reads a value and stores it in the variable with identifier i 3. write statements of the form urite e that print the value of the expression e Notes: • Tokens must be written in lowercase letters, eg. if, identifier. (The provided BNF shows non-terminals in a nonospaced font, but you do not need to worry about monospacing for your answers.) • Non-terminals must start with a capital letter, eg. If, Expression. (The provided BNF shows non-terminals in italics, but you do not need to worry about italics for your answers) Answer: (penalty regime: 10, 20. %) Program = Statements Statements = Stotement (; Stotement)" Statement = If| While | Assignment If = 1f Comparison then Statements else Statements v end While = while Comparison do Statements end Assignment = identifier Expression Read = Write = Comparison = Expression Relation Expression Relation =| l|<||>|> Expression = Term ((-|-) Term)" Term = Factor (*|) Foctor) Foctor = (Expression) | nunber | identifier Check

Extend the BNF in the answer bax below to include: 1. if-then-else-end statements (in addition to the if-then statements it already includes) 2. read statements of the form read i that reads a value and stores it in the variable with identifier i 3. write statements of the form urite e that print the value of the expression e Notes: • Tokens must be written in lowercase letters, eg. if, identifier. (The provided BNF shows non-terminals in a nonospaced font, but you do not need to worry about monospacing for your answers.) • Non-terminals must start with a capital letter, eg. If, Expression. (The provided BNF shows non-terminals in italics, but you do not need to worry about italics for your answers) Answer: (penalty regime: 10, 20. %) Program = Statements Statements = Stotement (; Stotement)" Statement = If| While | Assignment If = 1f Comparison then Statements else Statements v end While = while Comparison do Statements end Assignment = identifier Expression Read = Write = Comparison = Expression Relation Expression Relation =| l|<||>|> Expression = Term ((-|-) Term)" Term = Factor (*|) Foctor) Foctor = (Expression) | nunber | identifier Check

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 C++ program that read in students Test Grades, print the corresponding Letter Grades and Interpretations as shown in the table below using nested if ..else statements. Test Grades Letter Grades Interpretations0 – 44 F Fail45 – 49 E Weak Pass50 – 54 D Pass55 – 59 C Average60 – 64 C+ Above Average65 – 69 B Good70 – 74 B+ Very Good75 – 79 A- Excellent80 – 100 A Outstanding
Write out a truth table (including all four cases) for the following expressions. Here, p,q and r represent simple statements that can be true or false. ‌ a) ~p . q . ~r
Write a program that verifies the delimiters in a line of text or expression typed by theuser. In this case, we will take an arithmetic expression like a*(b+c)+[c/(a-b)]. Yourprogram needs to validate the expression such that opening and closing brackets areproper or not which means the brackets are balanced or not.
For the following statement, write down a logically equivalent statement which containsno operators other than ¬ and ∨: P ∧ (Q → R)
Question 4 Write a FA for a string literals in Java ( remember escape characters ) Write a FA for a character literals in Java ( remember escape characters ) This is programing concept class. please answer if u have knowledge about these concept. Thank you Text typing work only
Write the following compound statement in terms of the simple statements p, q, and r. "I go to office hours and ask questions, and my professor does not remember me." p: I go to office hours. q: I ask questions. r: My professor remembers me.
Let p, q, and r represent the following statements: p: The first ball is red. q: The second ball is white. r: The third ball is blue. Which would be the correct English statement for the symbolic form (¬¬p ∧∧ q) →→ r ? Group of answer choices A .If the first ball is red or the second ball is white, then the third ball is blue. B. If the first ball is not red or the second ball is white, then the third ball is blue. C .If the first ball is not red and the second ball is white, then the third ball is blue. D. If the first ball is red and the second ball is white, then the third ball is blue.
2. A truth table shows, for the various true or false values of boolean variables, what the result ofa boolean condition is. Fill in the following truth table. Assume that a, b and c are booleanvariables.a b c a && (!b || c)false false falsefalse false truefalse true falsefalse true truetrue false falsetrue false truetrue true falsetrue true true
I don't understand why if (isSolution==true) or if (isSolution = true) cannot be a legal start of a if statement as the isSolution was declared and assigned false. Logically, it makes sense, but I don't understand how to work out the syntax. Java Code: import java.util.Scanner; public class LabProgram {public static void main(String[] args) {/* Type your code here. */Scanner scnr= new Scanner(System.in);int x1=scnr.nextInt();int y1=scnr.nextInt();int z1=scnr.nextInt();int x2=scnr.nextInt();int y2=scnr.nextInt();int z2=scnr.nextInt();int x=0;int y=0;Boolean isSolution=false; for (int i= -10; i < 11; i++) {for (int j= -10; i < 11; j++) {if ((x1 * i + y1 * j == z1) && (x2 * i + y2 * j == z2)) isSolution = true; x=i;y=j; break;}}} if (isSolution==true) {System.out.println("x= " +x+ "y= " +y); } else {System.out.println("There is no solution");}}
(De Morgan’s Laws) In this chapter, we discussed the logical operators &&, ||, and !. DeMorgan’s Laws can sometimes make it more convenient for us to express a logical expression. Theselaws state that the expression !(condition1 && condition2) is logically equivalent to the expression(!condition1 || !condition2). Also, the expression !(condition1 || condition2) is logically equivalentto the expression (!condition1 && !condition2). Use De Morgan’s Laws to write equivalent expressions for each of the following, and then write a program to show that both the original expressionand the new expression in each case are equivalent.a) !(x < 5) && !(y >= 7)b) !(a == b) || !(g != 5)c) !((x <= 8) && (y > 4))d) !((i > 4) || (j <= 6))
Given the declaration:int num1, num2;int *p1;int *p2;double *p3;Mark the following statements as valid or invalid. If a statement is invalid, explain why. a. p1 = &num1;b. num2 = num1 - *p2;c. p3 = p2;d. *p3 = num1;e. *p3 = *p1;f. num1 5 p2;g. p1 = &p2;h. p3 = &num1;i. num1 = *p3;j. num2 = &p1;
After a specific amount of time has passed, an initial block statement can no longer be utilised.