Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Parser_combinator> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Parser_combinator abstract "In functional programming, a parser combinator is a higher-order function which accepts several parsers as input and returns a new parser as its output. In this context, a parser is a function accepting strings as input and returning some structure as output, typically a parse tree or a set of indices representing locations in the string where parsing stopped successfully. Parser combinators enable a recursive descent parsing strategy which facilitates modular piecewise construction and testing. This parsing technique is called combinatory parsing.Parsers built using combinators are straightforward to construct, ‘readable’, modular, well-structured and easily maintainable. They have been used extensively in the prototyping of compilers and processors for domain-specific languages such as natural language interfaces to databases, where complex and varied semantic actions are closely integrated with syntactic processing. In 1989, Richard Frost and John Launchbury demonstrated use of parser combinators to construct natural language interpreters. Graham Hutton also used higher-order functions for basic parsing in 1992. S.D. Swierstra also exhibited the practical aspects of parser combinators in 2001. In 2008, Frost, Hafiz and Callaghan described a set of parser combinators in Haskell that solve the long-standing problem of accommodating left recursion, and work as a complete top-down parsing tool in polynomial time and space.".
- Parser_combinator wikiPageExternalLink frost-launchbury.pdf.
- Parser_combinator wikiPageExternalLink p46-frost.pdf.
- Parser_combinator wikiPageExternalLink AI_03.pdf.
- Parser_combinator wikiPageExternalLink SCOMP_96.pdf.
- Parser_combinator wikiPageExternalLink parsing.pdf.
- Parser_combinator wikiPageExternalLink Parsec.
- Parser_combinator wikiPageExternalLink HaskellWorkshop.pdf.
- Parser_combinator wikiPageExternalLink cl-parser-combinators.
- Parser_combinator wikiPageExternalLink csharp-monad.
- Parser_combinator wikiPageID "16728666".
- Parser_combinator wikiPageRevisionID "605467730".
- Parser_combinator hasPhotoCollection Parser_combinator.
- Parser_combinator subject Category:Formal_languages.
- Parser_combinator subject Category:Functional_programming.
- Parser_combinator subject Category:Parsing.
- Parser_combinator type Abstraction100002137.
- Parser_combinator type Communication100033020.
- Parser_combinator type FormalLanguages.
- Parser_combinator type Language106282651.
- Parser_combinator comment "In functional programming, a parser combinator is a higher-order function which accepts several parsers as input and returns a new parser as its output. In this context, a parser is a function accepting strings as input and returning some structure as output, typically a parse tree or a set of indices representing locations in the string where parsing stopped successfully.".
- Parser_combinator label "Parser combinator".
- Parser_combinator sameAs m.0404c_g.
- Parser_combinator sameAs Q7139956.
- Parser_combinator sameAs Q7139956.
- Parser_combinator sameAs Parser_combinator.
- Parser_combinator wasDerivedFrom Parser_combinator?oldid=605467730.
- Parser_combinator isPrimaryTopicOf Parser_combinator.