Question

given the grammar G with following production rules, S--->a|aS| bS,
determine whether the string aababbba can be generated by the grammar

Answer 1

a* means what in an NfA?(non finite automata)

Answer 2

yes this string can be generated by this production rules

Answer 3

how? please state

Answer 4

I hope this will help u....

Answer 5

wW THANKS BUT I GOT LOST FROM STEP 4'AN YOU EXPLAIN THEM PLEASE

Answer 6

After 4th step we have to apply 3 production 3 times as our requirement so * denotes in many steps .but can also apply 3 steps individually one after another.

Answer 7

please do you have a pdf on this topic that can explain more . i am in an open university , so i don't have lectures only my book. please can you write a pdf or seed me series of pixs just to make me understand the concept

Answer 8

e.g .
consider the grammar
S--->L= R/R
L---->*R/i
R--->L
a) compute all the LR()) iterms for all the above grammer
b)construct an NFA whose states are the LR(0) iterms from (a)

Answer 9

Can u please take pic of problem and send I don't understand equation

Answer 10

And which notes u want context free grammar or n FSA??????

Answer 11

both if you have please. needed very urgently

Answer 12

thank you so much

Answer 13

hello you there?

Answer 14

Consider the grammar G below:
G: E  E + T / T
T  T * F / F
F  (E) / i
a) Generate the non-left recursive version of the grammar ) 5 marks

Answer 15

b) what are the augmented grammar for this grammar

Answer 16

 means (map to ) or ----->