• HAMPI

  • Referenced in 20 articles [sw09864]
  • membership in regular languages and bounded context-free languages. Hampi constraints may contain context-free...
  • MPTinR

  • Referenced in 15 articles [sw11244]
  • intuitive syntax or using the context-free language for MPTs. The ’classical’ .EQN file format...
  • UCFL

  • Referenced in 11 articles [sw02951]
  • concentrate on the class of Church Rosser Languages (CRL), the “deterministic counterpart” of GCSL ... UCFL denotes the class of unambiguous context-free languages. Our proof uses a novel pumping...
  • RLangGFun

  • Referenced in 7 articles [sw14280]
  • Regular languages and their generating functions: The inverse problem. The technique of determining ... generating function for an unambiguous context-free language is known as the Sch”utzenberger methodology...
  • XSugar

  • Referenced in 5 articles [sw35682]
  • languages. An XSugar specification is built around a context-free grammar that unifies...
  • JAMOOS

  • Referenced in 1 article [sw02520]
  • other language processing tools. As a programming language, JAMOOS brings a new tree computing metaphor ... reduction of rules in an attribute context-free grammar. JAMOOS has a rich object oriented ... system serves also as a language for specifying context-free grammars...
  • Codatatype

  • Referenced in 1 article [sw28678]
  • defined regular operations. Furthermore, a language for context-free grammars given by productions in Greibach...
  • Elkhound

  • Referenced in 8 articles [sw00236]
  • grammars, and can parse with any context-free grammar, including ambiguous grammars. However, adoption ... write a parser for C++, a language notorious for being difficult to parse...
  • TPstructure

  • Referenced in 4 articles [sw23814]
  • Topological language for RNA. In this paper we introduce a novel, context-free grammar, RNAFeatures...
  • YakYak

  • Referenced in 2 articles [sw07540]
  • constraints Programming language syntax is often described by means of a context-free grammar, which ... specifying constraints that are regular tree languages. Concise formulas about the parse tree replace explicit...
  • Bison

  • Referenced in 8 articles [sw26989]
  • parser generator that converts an annotated context-free grammar into a deterministic LR or generalized ... develop a wide range of language parsers, from those used in simple desk calculators...
  • libGE

  • Referenced in 2 articles [sw24012]
  • program, whose language is specified by a BNF (Backus-Naur Form) context-free grammar...
  • OpenNWA

  • Referenced in 3 articles [sw33220]
  • Library. Nested-word automata (NWAs) are a language formalism that helps bridge the gap between ... pushdown automata. NWAs can express some context-free properties, such as parenthesis matching, yet retain...
  • MedScan

  • Referenced in 3 articles [sw23129]
  • assumptions about the syntactic aspect of natural language. There is an urgent need ... engine utilizes a specially developed context-free grammar and lexicon. Preliminary evaluation of the system...
  • DynGenPar

  • Referenced in 1 article [sw06424]
  • parser aimed primarily at common natural mathematical language. Our algorithm combines the efficiency ... approaches and the expressiveness of extended context-free grammars such as parallel multiple context-free ... using the new parser, starting from natural language input as found in textbooks...
  • YAKKER

  • Referenced in 2 articles [sw17046]
  • parsing engine handles (1) full scannerless context-free grammars with (2) regular expressions as right ... examples ranging from difficult programming language grammars to web server logs to binary data specification...
  • Coq

  • Referenced in 1837 articles [sw00161]
  • Coq is a formal proof management system. It...
  • FEPG

  • Referenced in 5 articles [sw00276]
  • The finite element program generator (FEPG) is a...
  • gfun

  • Referenced in 138 articles [sw00344]
  • The gfun package provides tools for determining and...
  • Grail

  • Referenced in 21 articles [sw00374]
  • Grail is a symbolic computation environment for finite...