Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Exercise 1 Give a BNF grammar for each of the languages below. For example, a correct answer for "the set of all strings consisting of zero or more concatenated copies of the string ab" would be this grammar: := ab | There are often many correct answers. a. The set of all strings consisting of zero or more as. b. The set of all strings consisting of an uppercase letter followed by zero or more additional characters, each of which is either an uppercase letter or one NUC of the digits 0 through 9. c. The set of all strings consisting of one or more as.

Exercise 1 Give a BNF grammar for each of the languages below. For example, a correct answer for "the set of all strings consisting of zero or more concatenated copies of the string ab" would be this grammar: := ab | There are often many correct answers. a. The set of all strings consisting of zero or more as. b. The set of all strings consisting of an uppercase letter followed by zero or more additional characters, each of which is either an uppercase letter or one NUC of the digits 0 through 9. c. The set of all strings consisting of one or more as.

Database System Concepts
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
icon
Related questions
Question
100%

please do a, b, and c

thanks in advanced

Exercise 1 Give a BNF grammar for each of the languages below. For example, a correct answer for "the set of all strings consisting of zero or more concatenated copies of the string ab" would be this grammar: <S>= ab <S> | <empty> There are often many correct answers. a. The set of all strings consisting of zero or more as. b. The set of all strings consisting of an uppercase letter followed by zero or more additional characters, each of which is either an uppercase letter or one NUC of the digits 0 through 9. c. The set of all strings consisting of one or more as. d. The set of all strings consisting of one or more digits. (Each digit is one of the characters 0 through 9.) e. The set of all strings consisting of zero or more as with a semicolon after each use only, do one. f. The set of all strings consisting of the keyword begin, followed by zero or more statements with a semicolon after each one, followed by the keyword end. Use the non-terminal <statement> for statements, and do not give pro- ductions for it. g. The set of all strings consisting of one or more as with a semicolon after each one. h. The set of all strings consisting of the keyword begin, followed by one or e more statements with a semicolon after each one, followed by the keyword end. Use the non-terminal <statement> for statements, and do not give pro- ductions for it. wu@fainter i. The set of all strings consisting of one or more as, with a comma between each a and the next. (There should be no comma before the first or after the last.)
Transcribed Image Text:Exercise 1 Give a BNF grammar for each of the languages below. For example, a correct answer for "the set of all strings consisting of zero or more concatenated copies of the string ab" would be this grammar: <S>= ab <S> | <empty> There are often many correct answers. a. The set of all strings consisting of zero or more as. b. The set of all strings consisting of an uppercase letter followed by zero or more additional characters, each of which is either an uppercase letter or one NUC of the digits 0 through 9. c. The set of all strings consisting of one or more as. d. The set of all strings consisting of one or more digits. (Each digit is one of the characters 0 through 9.) e. The set of all strings consisting of zero or more as with a semicolon after each use only, do one. f. The set of all strings consisting of the keyword begin, followed by zero or more statements with a semicolon after each one, followed by the keyword end. Use the non-terminal <statement> for statements, and do not give pro- ductions for it. g. The set of all strings consisting of one or more as with a semicolon after each one. h. The set of all strings consisting of the keyword begin, followed by one or e more statements with a semicolon after each one, followed by the keyword end. Use the non-terminal <statement> for statements, and do not give pro- ductions for it. wu@fainter i. The set of all strings consisting of one or more as, with a comma between each a and the next. (There should be no comma before the first or after the last.)
j. The set of all strings consisting of an open bracket (the symbol [) followed by a list of one or more digits separated by commas, followed by a closing bracket (the symbol ]). use only, k. The set of all strings consisting of zero or more as, with a comma between each a and the next. (There should be no comma before the first or after the last.) f zero 01-28 1. The set of all strings consisting of an open bracket (the symbol [) followed by a list of zero or more digits separated by commas, followed by a closing bracket (the symbol ]).
Transcribed Image Text:j. The set of all strings consisting of an open bracket (the symbol [) followed by a list of one or more digits separated by commas, followed by a closing bracket (the symbol ]). use only, k. The set of all strings consisting of zero or more as, with a comma between each a and the next. (There should be no comma before the first or after the last.) f zero 01-28 1. The set of all strings consisting of an open bracket (the symbol [) followed by a list of zero or more digits separated by commas, followed by a closing bracket (the symbol ]).
Expert Solution
Step 1

We need to give BNF grammar for given scenarios. 

*As per the request a, b, and c is solved. 

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

I need the rest of it

Solution
Bartleby Expert
SEE SOLUTION
Knowledge Booster
Intelligent Machines
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS