title: Real-world LR(k > 1) grammars?
body: <p>Making artificial LR(k) grammars for k > 1 is easy:</p>
  
  <pre><code>Input: A1 B x
  Input: A2 B y                   (introduce reduce-reduce conflict for terminal a)
  A1   : a
  A2   : a
  B    : b b b ... b              (terminal b occurs k-1 times)
  </code></pre>
  
  <p>However, are there any <em>real-world</em> non-LR(1) computer languages that are LR(k > 1)-parsable?<br>
  Or are non-LR(1) languages also not LR(k) either?</p>