6.a. Write a BNF grammar that describes the structure of U.S. telephone numbers, which can be either (xxx)xxx-xxxx or xxx-xxxx, where x can be any digit from 0 to 9.b. Modify your grammar from Exercise 6a so that (1) the middle digit of an area code must be either a 0 or a 1, (2) the first digit of an area code cannot be a 0 or a 1, and (3) the firstdigit of the seven-digit phone number cannot be a 0 or a 1.c. Using your grammar from either Exercise 6a or 6b, show a parse tree for the phone number (612)555-1212.

Backus Naur Form (BNF): Syntax of the programming language is represented by using the notation called as Backus Naur Form (BNF). BNF grammar to describe the structure of U.S. telephone number <telephonenumber> is the non terminal object. The <telephonenumber> can be either (xxx)xxx-xxxx or xxx-xxxx and x can be any digit from 0 to 9. The BNF rule for <telephonenumber> is: Therefore, the above is a BNF grammar that describes the structure of a non terminal called <telephonenumber>. b) BNF grammar to describe the modified structure of telephone number <telephonenumber> is the non terminal object. The <telephonenumber> can be either (xxx)xxx-xxxx or xxx-xxxx and x can be any digit from 0 to 9. Second digit of the area code must be zero or one. First digit of the area code cannot be a zero or one. A seven digit phone number should not start with zero or one. The BNF rule for <telephonenumber> is: Therefore, the above is a BNF grammar that describes the modified structure of a non-terminal called <telephonenumber>.c) Parse tree for the telephone number (612)555-1212 : Parse tree is the representation of internal structure that starts with the individual token and ends with the desired goal using a grammar. Structure of the parse tree is: Root of the tree is the start symbol. Leaf node is the terminal object. Interior node is the non terminal object. Sentence appears in left to right direction of the leaves. Structure of the parse tree for the telephone number (612)555-1212 is shown below: Therefore, the above diagrammatic representation is the parse tree for the telephone number (612)555-1212 using the above BNF rule for <telephonenumber>.

Answered: Write a BNF grammar that describes the…

Engineering

Computer Science

Write a BNF grammar that describes the structure of U.S. telephone numbers, which can be either (xxx)xXx-XXXx or xxx-xXx, where x can be any digit from 0 to 9.

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

A) Write a BNF grammar for the language consisting of strings built only of the letters a and b. The strings may have any number of these letters, but the letter combinations bb must be in each string somewhere, and each string must start with a aa. For example, the strings aaabbabbba, aaaababba, and aababbabb are in the language, while a, bba, ababb, aabaa, and bbaa are not. B) Draw the parse tree for string aabbaaba according to the previous grammar: C) Describe, in complete English sentences and “layman’s terms,” the language defined by the following grammar in BNF (start symbol is <S>):<S> ::= <A>a | <B>b<C> ::= c<A> ::= a<A>a | <C><B> ::= b<B>b | <C>
8. L= {w|w e (0,1)* and |w| = 2} 9. L= {w|w € (0,1)* and |w|2 2} 10. L= {w|w e (0,1)* and |w|1}
5. a. Write a BNF grammar that describes the structure of a nonterminal called . Assume that contains an optional + sign followed by exactly two decimal digits, the first of which cannot be a 0. Thus 23, +91, and +40 are legal, but 9, +01, and 123 are not. b. Using your grammar from Exercise 5a, show a parse tree for the value +90.
1) Write a context-free grammar that accepts the language anbmcn, n >= 0, m >= 1. 2) What language does the following grammar accept? S -> ABC A -> aA A -> a B -> bBb B -> bb C -> cCd C -> cd
Let E = {a, b, c}. Write a grammar that generates the language: L = {c"ww* a":n > 0, m > 0, w e E+} HTML EditorÉ B I UA A 工E 三三 x x, : You Tube T T 12pt Paragraph G= ( {S,A}, {a,b,c}, S, P) P: S-> cSalcAa A->aAa|cAc 18 words
Build a context-free grammar. Use the usual notation to build the grammar that recognizes the FOR loop in the java and python languages. Please Explain
Rewrite the grammar below to eliminate left recursion.S-> S + A | AA -> A * B | BB -> (S) | id
Create a context-free grammar that is equivalent to N.
I need help Implementing a parser for the context-free grammar using Java Develop a parser that can take a sentence generated by the context-free grammar and parse it into a parse tree, which can be used to represent the structure of the sentence. In Java. Please follow the example
Write a context-free grammar for the language {dmcma"b"bªdª | m, n, q 2 3 }. Use as few variables as possible.
Write a BNF grammar for simple phone numbers e.g. (9)123-4567 (21)987-1234 The number must start with a left parenthesis, followed by 1or 2 digits, followed by a right parenthesis, followed by 3 digits, followed by a hyphen, followed by 4 digits. All digits, including 0, can be used anywhere a digit is required. There must be at least 3 rules in your grammar. The goal non-terminal should be called .
Chomsky Normal Form: Most useful grammars can be translated into a nor-mal form making answers to questions about the language more transparent.