Register

TOC Sentential Form

• edited by
1,406 views
1 votes
1 votes
Given grammar G, where e is epsilon,S,A are Non terminal.

G:- S->aSb | e | aA

Is aA a sentential form?
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
eyeamgj asked Dec 28, 2018
842 views
SELF DOUBT SENTENTIAL FORM (UPPCL AE PAPER)
Formally, α is sentential form if: A)S = > * α B)S = < * α C)S = > + α D)S =s < * α ANSWER IS GIVEN AS A
Formally, α is sentential form if:A)S = * αB)S = < * αC)S = + αD)S =s < * αANSWER IS GIVEN AS A
User Avatar
0 votes
0 votes
0 answers
3
tarun_svbk asked Feb 24, 2018
380 views
Sentential forms
Restricting only to the leftmost derivations, how many sentential forms can exhaustive search parsing generate ? $O(P^{\mid w \mid})$ $O(P^{\mid w \mid +1})$ $O(P^{2\mid w \mid})$ $O(P^{2\mid w \mid + 1})$ where, $P$ is the number of productions and w is the word to be generated.
Restricting only to the leftmost derivations, how many sentential forms can exhaustive search parsing generate ? $O(P^{\mid w \mid})$$O(P^{\mid w \mid +1})$$O(P^{2\mid w ...
User Avatar
2 votes
2 votes
1 answer
4
hustlerrr asked Nov 17, 2021
4,859 views
Greibach Normal Form
Convert the following grammar into Greibach Normal Form. E-> E + T | T T-> T*F | F F->(E) | a I am unable to process this type of grammer into GNF, Can someone please provide a detailed explaination?
Convert the following grammar into Greibach Normal Form.E- E + T | TT- T*F | FF->(E) | a I am unable to process this type of grammer into GNF, Can someone please provide ...
User Avatar
Link Copied!