• Elkhound

  • Referenced in 8 articles [sw00236]
  • Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because ... grammar, including ambiguous grammars. However, adoption of GLR has been slowed by high constant-factor ... present algorithmic and implementation enhancements to GLR to solve these problems. First, we present ... hybrid algorithm that chooses between GLR and ordinary LR on a token-by-token basis...
  • Bison

  • Referenced in 6 articles [sw26989]
  • into a deterministic LR or generalized LR (GLR) parser employing LALR(1) parser tables...
  • BRNGLR

  • Referenced in 2 articles [sw02711]
  • BRNGLR: a cubic Tomita-style GLR parsing algorithm...
  • dypgen

  • Referenced in 2 articles [sw24318]
  • dypgen is a GLR parser generator for Objective Caml, it is able to generate self...
  • DynGenPar

  • Referenced in 1 article [sw06424]
  • language. Our algorithm combines the efficiency of GLR parsing, the dynamic extensibility of tableless approaches...
  • DEXTER

  • Referenced in 1 article [sw24317]
  • interesting grammar classes such as LALR and GLR. Early work has shown that even when...
  • XGLR

  • Referenced in 1 article [sw02564]
  • XGLR--an algorithm for ambiguity in programming languages...
  • ANTLR

  • Referenced in 54 articles [sw03062]
  • ANTLR (ANother Tool for Language Recognition) is a...
  • KernSmooth

  • Referenced in 780 articles [sw04586]
  • Kernel smoothing refers to a general methodology for...
  • YACC

  • Referenced in 65 articles [sw26931]
  • Yacc (Yet Another Compiler-Compiler) is a computer...