The language accepted by a pushdown automata is
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
- 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
- Resolution of externally defined symbols is performed by a/an (A) linker (B) loader (C) compiler (D) interpreter
- Which of the following statements about parser is/are correct? 1. Canonical LR is more powerful than SLR. 2. SLR is more powerful than LALR. 3. SLR is more powerful than Canonical LR. Select the correct answer using the codes given below. (A) 1 only (B) 2 (C) 3 only (D) 1 and 3