The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+12 votes

+4 votes

power of PArser is derived on the basis of NO. of language parsed....

CLR could parsed all the language which could parsed by other.....

@Divyanshum29

No. Check this grammar

S --> aX | Eb | Fc

X --> Ec | Fb

E --> A

F --> A

A --> epsilon.

Its LL(1) but not LALR(1).

No. Check this grammar

S --> aX | Eb | Fc

X --> Ec | Fb

E --> A

F --> A

A --> epsilon.

Its LL(1) but not LALR(1).

@reena

" Power of parser is in terms of number of GRAMMARS they can parse NOT the number Of LANGUAGES. "

Can u explain a bit more?

" Power of parser is in terms of number of GRAMMARS they can parse NOT the number Of LANGUAGES. "

Can u explain a bit more?

What she meant was Parser always corresponds to a grammer...for every grammer u will have a corresponding language a language can have many grammars but for every DCFL there is gaurenteed to exist one unambiguos one .. we should not relate a language to the parser as it will be designed based on the grammer rules and its not EXACTLY correct

- All categories
- General Aptitude 1.2k
- Engineering Mathematics 4.7k
- Digital Logic 1.9k
- Programming & DS 3.5k
- Algorithms 3k
- Theory of Computation 3.7k
- Compiler Design 1.5k
- Databases 2.8k
- CO & Architecture 2.5k
- Computer Networks 2.9k
- Non GATE 837
- Others 1.2k
- Admissions 278
- Exam Queries 396
- Tier 1 Placement Questions 17
- Job Queries 50
- Projects 7

33,687 questions

40,231 answers

114,271 comments

38,801 users