The language L that is generated over Σ = {0, 1} for regular expression L(r) = (0 + 10)* 1(1 + 10)* represents
Asked in Meghalaya PSC QUESTION BOOKLET: SERIES I
Answer under review: our editors are checking this question. Try the other MPSC Prelims previous year questions questions meanwhile.
More MPSC Prelims previous year questions questions
- The grammar G1 is defined with productions S → 0A|1B, A → 0AA|1S|1, B → 1BB|0S|0. The grammar G2 is defined with productions S → AB|aaB, A → A|Aa, B → b. Which grammar is/are ambiguous?
- The language accepted by a pushdown automata is
- A context-free grammar is recognized by
- The pumping lemma is used to prove that
- Consider the grammar : S → a S → ab The given grammar is (A) LR(1) only (B) LL(1) only (C) Both LR(1) and LL(1) (D) LR(1) but not LL(1)
- The First and Follow sets for the grammar S → SS+|SS*|a are (A) First (S) = {a} and Follow (S) = {+, *, $} (B) First (S) = {+} and Follow (S) = {+, *, $} (C) First (S) = {a} and Follow (S) = {+, *} (D) First (S) = {+, *} and Follow (S) = {+, *, $}
- The action of parsing the source program into the proper syntactic classes is known as (A) lexical analysis (B) syntax analysis (C) interpretation analysis (D) parsing
- Which of the following is not a bottom-up parser? (A) LALR (B) Predictive parser (C) CLR (D) SLR