• Penn Treebank

  • Referenced in 100 articles [sw08023]
  • linguistic structure. Most notably, we produce skeletal parses showing rough syntactic and semantic information...
  • DART

  • Referenced in 71 articles [sw07260]
  • external environment using static source-code parsing; (2) automatic generation of a test driver...
  • ANTLR

  • Referenced in 64 articles [sw03062]
  • parser that can build and walk parse trees...
  • Hets

  • Referenced in 59 articles [sw07017]
  • Heterogeneous Tool Set. Hets is a parsing, static analysis and proof management tool incorporating various...
  • RStan

  • Referenced in 59 articles [sw13990]
  • functions are provided by this package to parse, compile, test, estimate, and analyze Stan models...
  • AGG

  • Referenced in 49 articles [sw04449]
  • several kinds of validations which comprise graph parsing, consistency checking of graphs and conflict detection...
  • CakeML

  • Referenced in 49 articles [sw08799]
  • breadth of topics including lexing, parsing, type checking, incremental and dynamic compilation, garbage collection, arbitrary...
  • GF

  • Referenced in 32 articles [sw13667]
  • used both for linearizing syntax trees and parsing strings. GF can describe both formal...
  • TXL

  • Referenced in 18 articles [sw11319]
  • interpretation, application, order and backtracking of both parsing and rewriting rules. Using first order functional ... experiment with both new ideas in parsing, such as robust, island and agile parsing...
  • rstan

  • Referenced in 28 articles [sw16103]
  • User-facing R functions are provided to parse, compile, test, estimate, and analyze Stan models...
  • PointNet

  • Referenced in 27 articles [sw31209]
  • object classification, part segmentation, to scene semantic parsing. Though simple, PointNet is highly efficient...
  • JastAdd

  • Referenced in 23 articles [sw01700]
  • JastAdd system is independent of the underlying parsing technology and supports any noncircular dependencies between...
  • bioperl

  • Referenced in 22 articles [sw10579]
  • storage in RDMBS (bioperl-db), running and parsing the results from hundreds of bioinformatics applications...
  • Minlog

  • Referenced in 20 articles [sw09765]
  • means of two examples: one about parsing, the other about exact real numbers in signed...
  • Dyna

  • Referenced in 11 articles [sw23357]
  • classes run a generalization of agenda-based parsing, prioritizing the partial parses by some figure ... practices. Dyna is now being used for parsing, machine translation, morphological analysis, grammar induction...
  • LZ77

  • Referenced in 18 articles [sw32964]
  • also known as Lempel-Ziv or LZ77 parsing). We present C++ implementations of different algorithms...
  • XML

  • Referenced in 17 articles [sw07335]
  • Tools for parsing and generating XML within R and S-Plus. This package provides many...
  • biXid

  • Referenced in 9 articles [sw12667]
  • evaluation algorithm for biXid, consisting of the “parsing” phase that transforms the input document ... intermediate “parse tree” structure and the “unparsing” phase that transforms it to an output document ... pass scan on the input or the parse tree by using a standard technique that ... ambiguity causes different ways of consuming the parse tree and thus results in multiple possible...
  • TRX

  • Referenced in 9 articles [sw08800]
  • formally verified parser interpreter. Parsing is an important problem in computer science and yet surprisingly ... producing formally correct parsers. We are using parsing expression grammars (PEGs), a formalism essentially representing ... recursive descent parsing, which we consider an attractive alternative to context-free grammars (CFGs). From...
  • Elkhound

  • Referenced in 8 articles [sw00236]
  • Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because ... asymptotically efficient for typical grammars, and can parse with any context-free grammar, including ambiguous ... language notorious for being difficult to parse. Our C++ parser is small (3500 lines), efficient...