Search
51 results for “Parser”
DiDiscourse representation theoryIn formal linguistics, discourse representation theory (DRT) is a framework for exploring LoLogic programmingLogic programming is a programming, database, and knowledge representation paradigm based InInternational Chemical IdentifierThe International Chemical Identifier (InChI, pronounced IN-chee) is a textual identifierBIBI-RADSThe Breast Imaging-Reporting and Data System (BI-RADS) is a quality assurance tool originaOpOpenXDFThe Open eXchange Data Format, or OpenXDF, is an open, XML-based standard for the digital SBSBMLThe Systems Biology Markup Language (SBML) is a representation format, based on XML, for cFAFASTQ formatFASTQ format is a text-based format for storing both a biological sequence (usually nucleoPiPileup formatPileup format is a text-based format for summarizing the base calls of aligned reads to a StStockholm formatStockholm format is a multiple sequence alignment format used by Pfam, Rfam and Dfam, to dGrGrammar inductionGrammar induction (or grammatical inference) is the process in machine learning of learninJaJay EarleyJay Earley is an American computer scientist and psychologist. He invented the Earley pars
Formal grammarA formal grammar is a set of symbols and the production rules for rewriting some of them i
UnparserIn computing, an unparser is a system that constructs a set of characters or image componeMiMichael Collins (computational linguist)Michael J. Collins (born 4 March 1970) is a researcher in the field of computational lingu
Lexicon-grammarLexicon-Grammar is a method and a praxis of formalized description of human languages, whiAmAmbiguous grammarIn computer science, an ambiguous grammar is a context-free grammar for which there existsDaDangling elseThe dangling else is a problem in programming of parser generators in which an optional el
Formal grammarA formal grammar is a set of symbols and the production rules for rewriting some of them i
UnparserIn computing, an unparser is a system that constructs a set of characters or image componeCoConstraint grammarConstraint grammar (CG) is a methodological paradigm for natural language processing (NLP)CoCompiler-compilerIn computer science, a compiler-compiler or compiler generator is a programming tool that AtAttribute grammarAn attribute grammar is a formal way to supplement a formal grammar with semantic informatInInverse parserAn inverse parser, as its name suggests, is a parser that works in reverse. Rather than thCaCamlp4Camlp4 is a software system for writing extensible parsers for programming languages. It pLeLexer hackIn computer programming, the lexer hack is a solution to parsing a context-sensitive grammDeDeterministic parsingIn natural language processing, deterministic parsing refers to parsing algorithms that doLeLeft cornerIn formal language theory, the left corner of a production rule in a context-free grammar TeText parserIn adventure games, a text parser takes typed input (a command) from the player and simpliSySyntactic predicateA syntactic predicate specifies the syntactic validity of applying a production in a formaPaParser combinatorIn computer programming, a parser combinator is a higher-order function that accepts severLiLisp readerIn the programming language Lisp, the reader or read function is the parser which convertsMXMXparsermXparser is an open-source mathematical expressions parser/evaluator providing abilities tJoJorge HankamerJorge Hankamer is Professor of Linguistics at the University of California, Santa Cruz, whDiDivide-and-conquer algorithmIn computer science, divide and conquer, originally a political maxim, designates an algor
Abstract syntax treeAn abstract syntax tree (AST) is a data structure used in computer science to represent thDeDeterministic context-free languageIn formal language theory, deterministic context-free languages (DCFL) are a proper subseDeDeterministic context-free grammarIn formal grammar theory, the deterministic context-free grammars (DCFGs) are a proper subGrGreibach normal formIn formal language theory, a context-free grammar is in Greibach normal form (GNF) if the L-L-attributed grammarL-attributed grammars are a special type of attribute grammars. They allow the attributes
LL grammarIn formal language theory, an LL grammar is a context-free grammar that can be parsed by aLaLanguage-theoretic securityLanguage-theoretic security, or LangSec, is an approach to software security that focuses PaParsing expression grammarIn computer science, a parsing expression grammar (PEG) is a type of analytic formal grammOpOperator-precedence grammarAn operator precedence grammar is a kind of grammar for formal languages.S-S-attributed grammarIn formal language S-attributed grammars are a class of attribute grammars characterized bSiSimple precedence grammarIn computer science, a simple precedence grammar is a context-free formal grammar that canSLSLR grammarSLR grammars are the class of formal grammars accepted by a Simple LR parser. SLR grammarToTop-down parsing languageTop-Down Parsing Language (TDPL) is a type of analytic formal grammar developed by AlexandSySyntax diagramSyntax diagrams (or railroad diagrams) are a way to represent a context-free grammar. TheyMuMutual recursionIn mathematics and computer science, mutual recursion is a form of recursion where two or PePerl::CriticPerl::Critic is a static code analysis system for the Perl programming language. Perl::CriReRemote Telescope Markup LanguageThe Remote Telescope Markup Language (RTML) is an XML dialect for controlling remote and/o