 The special attribute of this parser is that any LR(k) grammar with "k>1" can be transformed into an LR(1) grammar.However, back-substitutions are required to reduce k and as back-substitutions increase, the grammar can quickly become large, repetitive and hard to understand.LR(k) can handle all deterministic context-free languages..