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?
24. Suppose that you are defining a grammar for scientific notation numbers. (Ex: "1.3e+5"). What are supposed to be the terminals in this language? (Tip: try to use a float point representation using regular expression).
3. Given the following BNF grammar: -> d c | cd -> a la -> b | b Use the top-down recursive descent method which we discussed in the class to implement a parser (i.e. tdrd.parser.py) in python3 for the above BNF grammar. The input data file name is given from the command line. You may assume that there is a space character between two terminals (e.g. a a adc b ) in the data file.
Chomsky Normal Form: Most useful grammars can be translated into a nor-mal form making answers to questions about the language more transparent.
Please fast solve the issue but don't copy
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 ※ 总 !!
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
Computer Science
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!
In GO lang 5. EBNF grammar for a concert calendar · You may assume that the tokens date, time, word and num have already been defined · A concert calendar is a list of concert events, where each event includes: • A date and time • The name of the performing group or artist, optionally followed by "(21+)" if there is a minimum age requirement to see the concert • A pipe (|) character • The name of the venue where the concert will be held, like "Pavilion" or "San Jose Ritz" • A pipe (|) character • The city where the venue is located • The price, possibly followed by a + if there are also more expensive tickets. Examples: "$15", "$30+" Example calendar: Oct 16 8:00 pm Band X | Pavilion | Concord $20+ Oct 21 10:00 pm BYOB (21+) | Club Nouveau | San Leandro $10

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