Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Consider the following grammar for a simple programming language: ::= | ::= | | ::= = ; ::= repeat ( ) ::= print ; ::= | ::= | ::= | - | ( ) ::= | ::=a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | r | st | u | v | w | x | y | z ::= | ::= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 ::= + | ::= * ● Using Finite State Machine Designer , create a DFA that will recognize all tokens in this grammar. • Do the following steps: ● identify tokens in the language over this grammar o write regular expressions for each of the tokens o transition each regular expression to NFA o start with primitive automata and use the rules from the lecture to create the complete DFA. O

Consider the following grammar for a simple programming language: ::= | ::= | | ::= = ; ::= repeat ( ) ::= print ; ::= | ::= | ::= | - | ( ) ::= | ::=a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | r | st | u | v | w | x | y | z ::= | ::= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 ::= + | ::= * ● Using Finite State Machine Designer , create a DFA that will recognize all tokens in this grammar. • Do the following steps: ● identify tokens in the language over this grammar o write regular expressions for each of the tokens o transition each regular expression to NFA o start with primitive automata and use the rules from the lecture to create the complete DFA. O

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
• Consider the following grammar for a simple programming language: <program> ::= <statement> | <program> <stmt> <stmt> ::= <assignStmt> | <repeatStmt> | <printStmt> <assignStmt> ::= <id> = <expr> ; <repeatStmt> ::= repeat (<expr> ) <stmt> <printStmt> ::= print <expr> ; <expr> ::= <term> | <expr> <add0p> <term> <term> ::= <factor> | <term> <multOp> <factor> <factor> ::= <id> | <number> | <factor> | ( <expr> ) <id> :: <letter> | <id> <letter> <letter> ::= a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | r | s | t | u | v | w | x | y | z <number> ::= <digit> | <number> <digit> <digit> ::= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 <addOp>:= + I <multOp> ::= * | / | % Using Finite State Machine Designer, create a DFA that will recognize all tokens in this grammar. • Do the following steps: identify tokens in the language over this grammar o write regular expressions for each of the tokens o transition each regular expression to NFA o start with primitive automata and use the rules from the lecture to create the complete DFA. O
Transcribed Image Text:• Consider the following grammar for a simple programming language: <program> ::= <statement> | <program> <stmt> <stmt> ::= <assignStmt> | <repeatStmt> | <printStmt> <assignStmt> ::= <id> = <expr> ; <repeatStmt> ::= repeat (<expr> ) <stmt> <printStmt> ::= print <expr> ; <expr> ::= <term> | <expr> <add0p> <term> <term> ::= <factor> | <term> <multOp> <factor> <factor> ::= <id> | <number> | <factor> | ( <expr> ) <id> :: <letter> | <id> <letter> <letter> ::= a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | r | s | t | u | v | w | x | y | z <number> ::= <digit> | <number> <digit> <digit> ::= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 <addOp>:= + I <multOp> ::= * | / | % Using Finite State Machine Designer, create a DFA that will recognize all tokens in this grammar. • Do the following steps: identify tokens in the language over this grammar o write regular expressions for each of the tokens o transition each regular expression to NFA o start with primitive automata and use the rules from the lecture to create the complete DFA. O
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Sorting
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.
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