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.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter3: Understanding Structure

Section: Chapter Questions

Problem 7RQ

See similar textbooks

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.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions

exp->exp addop term | termaddop->+|-term->term mulop factor |factormulop->*factor->(exp) | number write down leftmost derivations, parse trees, and abstract syntax trees for the following expression:3+4*5-6
Describe the activities done by the driver of a bottom-up parser.
Recursive Descent subprogram with EBNF rule, using C or Java syntax (syntax) Type (Recursive-Descent Subprogram): -> while () ; The lex method to be used reads a single lexeme, and the lexemes' token code is in the nextToken variable is to the left. Suppose that the defined tokens are respectively: while - WHILE_CODE left parantex - LEFTPAREN_CODE right parenthesis - RIGHTPAREN_CODE semicolon - SEMICOLON_CODE If any error is caught, create the function that calls the error function.
3. Write the parser for the following grammar: class: CLASS ID {listDecl} decl: declVar | declFunc Decl list: Decl list decl | epsilon declVar: ID ID declFunc: ID ID (arguments) arguments: declVar (, arguments | epsilon) | epsilon
9. It is required to write a parser for the grammar below. <source_file> ::= <declarations> <code> <declarations> ::= vars <list_of_variables> ; <list_of_variables> ::= <variable> | <list_of_variables> , <variable> <code> ::= <statements> . <statements> ::= <assignment> | <statements> ; <assignment> <assignment> ::= <variable> := <expression> <expression> ::= <expression> + <term> | <expression> - <term> | <term> <term> ::= <term> * <factor> | <term> / <factor> | <factor> <factor> ::= <number> | <variable>
In GO LANGUAGE 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
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?
Build a sablecc grammar file for the following grammar: & A a a A - > % > C A - S S % C - <
Write an EBNF rule that describes the for-statement of Java or C++. Write the recursive descent subprogram in Java or C++ for this rule.
Describe the activities that are carried out by the driver of a bottom-up parser.
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
CFG Assignment(at least 2 strings must be derive to prove each CFG) Language: of all strings having many 0’s or no zero, defined over {0} Language: of all strings having exactly one 0’s or exactly one 1, defined over {0,1} Language: of all strings having many 0’s or many 1’s or no zero or no one, defined over {0,1} 0*10*