kindly ,
all fellows.\
plzzzzzzzzz.
share your quizzes here.
Allah bhla kray sab ka.
Tags:
The regular expressions a*|b* and (a|b)* describe the _____set of strings.
Same
Different
Onto
A canonical collection of sets of items for an augmented grammar, C is constructed as -----
For each set / in C and each grammar symbol X where goto (C, X) is empty and not in C add the set goto (C, X) to C.
The first set in C is the closure of {[S' --> .S]}, where S’ is starting symbol of original grammar and S is the starting non-terminal of augmented grammar.
The first set in C is the closure of {[S' --> .S]}, where S is starting symbol of original grammar and S' is the starting non-terminal of original grammar.
S --> a | B B --> Bb | E The non-terminal _______ is left recursive.
------ is a top down parser.
Consider the following grammar, S --> aTUe T --> Tbc/b U --> d And suppose that string “abbcde” can be parsed bottom-up by the following reduction steps: (i) aTbcde (ii) aTde (iii) aTUe (iv) S So, what can be a handle from the following?
The (a) in (aTUe)
The (a) in (aTUe)
The (d) in (aTUe)
who will help to solve this quiz?
In an attribute grammar each production rule(N--> a) has a corresponding attribute evaluation rule that describes how to compute the values of the _______attributes of each particular node N in the AST.
Select correct option:
Consider the following grammar, S --> aTUe T --> Tbc/b U --> d And suppose that string “abbcde” can be parsed bottom-up by the following reduction steps: (i) aTbcde (ii) aTde (iii) aTUe (iv) S So, what can be a handle from the following?
Select correct option:
When constructing an LR(1) parser we record for each item exactly in which context it appears, which resolves many conflicts present in _______parsers based on FOLLOW sets.
Select correct option:
The ______translation statements can be conveniently specified in YACC
Select correct option:
We use ----- to mark the bottom of the stack and also the right end of the input when considering the Stack implementation of Shift-Reduce Parsing.
Select correct option:
Grammars with LL(1) conflicts can be made LL(1) by applying left-factoring, substitution, and left-recursion removal. Left-factoring takes care of ________conflicts.
Select correct option:
When generating a lexical analyzer from a token description, the item sets (states) are constructed by two types of “moves”: character moves and ____ moves.
Select correct option:
Bottom-up parsers handle a _________________ class of grammars.
Select correct option:
Let a grammar G = (Vn, Vt, P, S) is modified by adding a unit production S’--> S to the grammar and now starting non-terminals becomes S’ and grammar becomes G’ = (Vn U {S’}, Vt, PU{S’ --> S}, S’). The Grammar G’ is called the -----------
Select correct option:
The LR(1) items are used as the states of a finite automaton (FA) that maintains information about the parsing stack and progress of a shift-reduce parser.
Select correct option:
Backpatching to translate flow-of-control statements in ____ pass.
Select correct option:
Consider the following grammar, S --> aTUe T --> Tbc/b U --> d And suppose that string “abbcde” can be parsed bottom-up by the following reduction steps: (i) aTbcde (ii) aTde (iii) aTUe (iv) S So what can be a handle from the following?
Select correct option:
© 2021 Created by + M.Tariq Malik. Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
We are user-generated contents site. All product, videos, pictures & others contents on site don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List | Moderators Group
All Members | Featured Members | Top Reputation Members | Angels Members | Intellectual Members | Criteria for Selection
Become a Team Member | Safety Guidelines for New | Site FAQ & Rules | Safety Matters | Online Safety | Rules For Blog Post