How to determine whether a language is LL(1) LR(0) SLR(1)?

Question

Is there a simple way to determine whether a grammar is LL(1), LR(0), SLR(1)... just from looking on the grammar without doing any complex analysis? For instance: To decide whether a BNF Grammar is LL(1) you have to calculate First and Follow sets - which can be time consuming in some cases. Is there a way to do this faster?

Answer 1

Hi Asked,

I think you are asking if it is possible to quickly recognize various grammar types from a small sampling of their permitted (parsable) outputs. I can't think why it would be, since you are estimating total grammar organization from an infinitesimal proportion of its output. And while a grammar can operate in such a way on the outputs, no program of comparable complexity can analyse its operation, if I recall Go:del on sets correctly?

-- Cheers, -- Mr. d.