FIRST set for CFG/grammar in C/C++. input is grammar , output is shown the first set. example input grammer : E -> TR R -> +T R| # T -> F Y Y -> *F Y | # F -> (E) | i Output : First(E)= { (, i, } First(R)= { +, #, } First(T)= { (, i, } First(Y)= { *, #, } First(F)= { (, i, } Assumptions : Epsilon is represented by ‘#’. Productions are of the form A=B, where ‘A’ is a single Non-Terminal and ‘B’ can be any combination of Terminals and Non- Terminals. L.H.S. of the first production rule is the start symbol. Grammar is not left recursive. Each production of a non-terminal is entered on a different line. Only Upper Case letters are Non-Terminals and everything else is a terminal. Do not use ‘!’ or ‘$’ as they are reserved for special purposes.
FIRST set for CFG/grammar in C/C++. input is grammar , output is shown the first set. example input grammer : E -> TR R -> +T R| # T -> F Y Y -> *F Y | # F -> (E) | i Output : First(E)= { (, i, } First(R)= { +, #, } First(T)= { (, i, } First(Y)= { *, #, } First(F)= { (, i, } Assumptions : Epsilon is represented by ‘#’. Productions are of the form A=B, where ‘A’ is a single Non-Terminal and ‘B’ can be any combination of Terminals and Non- Terminals. L.H.S. of the first production rule is the start symbol. Grammar is not left recursive. Each production of a non-terminal is entered on a different line. Only Upper Case letters are Non-Terminals and everything else is a terminal. Do not use ‘!’ or ‘$’ as they are reserved for special purposes.
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
Related questions
Question
FIRST set for CFG/grammar in C/C++.
input is grammar , output is shown the first set.
example input grammer :
E -> TR
R -> +T R| #
T -> F Y
Y -> *F Y | #
F -> (E) | i
Output :
First(E)= { (, i, }
First(R)= { +, #, }
First(T)= { (, i, }
First(Y)= { *, #, }
First(F)= { (, i, }
Assumptions :
- Epsilon is represented by ‘#’.
- Productions are of the form A=B, where ‘A’ is a single Non-Terminal and ‘B’ can be any combination of Terminals and Non- Terminals.
- L.H.S. of the first production rule is the start symbol.
- Grammar is not left recursive.
- Each production of a non-terminal is entered on a different line.
- Only Upper Case letters are Non-Terminals and everything else is a terminal.
- Do not use ‘!’ or ‘$’ as they are reserved for special purposes.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
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
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