Theoretical Properties

• Formally developed by Birman in 1970s

  • Proved existence of linear-time parsing algorithm
  • ...but apparently never implemented

• Recognizable languages:

  • Strictly larger than deterministic parsing algorithms: e.g., LL(k), LR(k)
  • Incomparable to class of context-free languages