Recent questions tagged parsing - GATE CSE Doubts

0 votes

0 answers

Madeeasy workbook (Parsing)
Consider the following grammer: S → S | S;S S → V = E V → id[E] | id E → id | (E) Find the number of conflicts in LR(0).

asked Nov 20 in Compiler Design by chinmayetw (6 points) | 4 views

0 votes

0 answers

Gatebook: Compiler Design
Consider the context-free grammar G : S → aSbS | bSaS | ε How many parse trees are there for the sentence ababababab ? Doubt: When can Catalan number be used for finding number of parse trees? And what is the general procedure for finding the number of parse trees in a question like this where the number of such trees is large? Answer is 42.

asked Nov 14 in Compiler Design by Sambhrant Maurya (290 points) | 18 views

0 votes

0 answers

Made Easy Test Series Compiler Design (topic wise Q.16)

asked Nov 13 in Compiler Design by arya_stark (64 points) | 23 views

0 votes

0 answers

MadeEasy TOPICWISE : COMPILER DESIGN-2 (GATE - 2020) Q16 paring table

asked Nov 3 in Compiler Design by DukeThunders (288 points) | 60 views

0 votes

1 answer

Success Gateway: CD
Consider the following grammar, where S and T are non-terminals and +, * and a are terminals. S→S∗S|S+S|T|a T→a The total number of possible parse trees for the string a∗a+a is?

asked Aug 19 in Compiler Design by Sambhrant Maurya (290 points) | 26 views

0 votes

1 answer

Self Doubt in Parsers
“Any DCFL has an equivalent grammar that can be parsed by a SLR(1) parser with end string delimiter” True or False? What about LR(0) for the same?

asked Aug 18 in Compiler Design by Sambhrant Maurya (290 points) | 28 views

0 votes

0 answers

GO CD Test 2019
For which of the following languages a LL(1) grammar does not exist? {$a^{n}ob^{n}$∣n≥1}∪{$a^{n}b^{n}$∣n≥1} {$a^{n}b^{m}$∣m,n≥0} {$a^{i}b^{j}$∣i≥j} {$a^{i}b^{j}$∣i=j} Why C is the answer here? Can anyone explain?

asked Aug 18 in Compiler Design by Sambhrant Maurya (290 points) | 11 views

0 votes

1 answer

Success Gateway: Parsers
Consider the following two grammars G1: A → A1 | 0A1 | 01 G2: A → 0A | 1 Which of the following is True regarding above grammars? (a) L1 is LR(k) (b) L2 is LR(k) (c) Both L1 and L2 is LR(k) (d) None is LR(k)

asked Aug 18 in Compiler Design by Sambhrant Maurya (290 points) | 39 views

0 votes

0 answers

LR Parser in compiler design
Can anyone give a counter-example grammar which proves that LR parsers cant parse every non – deterministic unambiguous CFL ?

asked Jul 13 in Compiler Design by user2525 (1.6k points) | 15 views

0 votes

0 answers

grammar and parser
I m bit confused in types of grammar, which is parsed by what type of parser. plz clear it. Can LR parser, parse only context free grammar or it can parse context sensitive grammar? If no, then which parser is used for CSG?

asked Jul 13 in Compiler Design by Shubhm (23 points) | 8 views

To see more, click for the full list of questions or popular tags.

2,317 questions

1,295 answers

6,601 comments

89,719 users