Can someone tell me if this is right please? +c. Write a BNF grammar and a regular expression that describes thestructure of US telephone numbers, which can either be (xxx)xxx-xxxx orXXX-XXXX, where x is a digit from 0 to 9.Grammar ::= | ::= "(" ")" "-" "-" ::= "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9"Regular expression(\(\d{3}\)\d{3}-\d{4}|\d{3}-\d{4})

This BNF grammar is appropriate for US telephone numbers in the following two formats:(xxx)xxx-xxxx,…

Answered: + c. Write a BNF grammar and a regular…

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

C++ Consider the language that the following grammar defines: <S> = c | <W> | c<S> <W> = abb|a<W>bb Write all strings that are in this language and that contain seven or fewer characters. If the answer includes multiple strings, you must enter the answers in alphabetical order. A. In alphabetic order, what are the two strings in this language that are 3 characters in length? B. In alphabetic order, what are the two strings in this language that are 4 characters in length? C. In alphabetic order, what are the two strings in this language that are 5 characters in length?
Chomsky Normal Form: Most useful grammars can be translated into a nor-mal form making answers to questions about the language more transparent.
Question 13 Write a function in Scheme or rules in Prolog called countlt that takes a list of numbers, L. and another number. N. and returns the count of numbers less than N in the list L. Example calls Scheme: (countlt '(6 1 9) 4) -> 1 (countlt '(50 27 13) 1) -> 0 Prolog ?- countlt (I6, 1, 91, 4, X) . X = 1. ?- countlt ( [50, 27, 131, 1, X). X = 0. Edit View Insert Format Tools Table 12pt v Paragraph v В I U ※ 总 !!
2. A piece of declaration code in C programming language is as follows: typedef struct { int a, b; } CELL, *PCELL; CELL foo[100]; PCELL bar ( int x, CELL y ); Write the type expression for foo and bar. 3. Write an SDT for the following grammar, which can perform type checking. The type of S is the valid type of its body. S -> id := E | if E then S | while E do S | S; S
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>
I have a problem in C++ programming. Im needing to create a parser that follows the BNF rules in the photo. No need to create a lexical analyzer, Im just needing help in actually doing a parser
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 first digit 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.
Pp# 2: can you help me solve and understand this practice problem please? A step by step explanation would be appreciated. Thank you!
I need help creating a context free grammar that can develop multiple sentences it must be done in Java with the following 1. Identifying the syntax and grammar rules of American English: This involves analyzing the grammatical structure of sentences in American English and identifying the different parts of speech and how they are used in sentences. 2. Developing a set of context-free grammar rules: Based on the analysis of American English syntax and grammar, develop a set of context-free grammar rules that can be used to generate valid sentences in American English. a. Defining a set of nonterminal symbols that represent parts of speech, such as nouns, verbs, adjectives, adverbs, and prepositions. b. Defining a set of terminal symbols that represent words in the English language. c. Defining production rules that describe how nonterminal symbols can be expanded into other nonterminal symbols and terminal symbols. 3. Implementing a parser for the context-free grammar using…
plz help explain
1.Write a C++ program to test whether a given digit is valid or not by entering on output your ID to check the validity of the digit and try the non valid digit on output either 2. Write a program in C++ to recognize strings under 'k+', 'km', 'kkm+' and try on output the acceptance of string under the above rules 3. Write a program in C++ to check whether a string belongs to a grammar or not for the following grammar and show the output for both the valid and invalid strings, respectively Y->mNz 4. Write a program in FLEX for implementing a calculator and do the following arithmetic expressions: 99/9/1 5-5*6 7+12/12*2
The following is a grammar for JH-Lisp 2.1, modified version of the language you encountered in homework 4, with slightly different syntax, and expanded set of functions. It uses underscores rather than spaces, square brackets rather than paren- theses, and words as function names instead of symbolic operators. S →[O E E] E →[O E E]|N N →0|1|2|3|4|5|6|7|8|9|NN O →add|sub|mul|div|mod|shl|shr Create a PDA that recognizes JH-Lisp 2.1.

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS