About: Parser combinator

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Parser combinator Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatFormalLanguages, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/3jby7Uoaxt

In computer programming, a parser combinator is a higher-order function that 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 that facilitates modular piecewise construction and testing. This parsing technique is called combinatory parsing.

Attributes	Values
rdf:type	yago:Abstraction100002137 yago:Communication100033020 yago:Language106282651 disease yago:WikicatFormalLanguages
rdfs:label	Parser combinator (en) 语法分析组合子 (zh)
rdfs:comment	在计算机编程中语法分析组合子是一个高阶函数，它接受几个的语法分析器作为输入，并返回一个新的语法分析函器作为其输出。在这个上下文中，语法分析器是一个函数，它接受字符串作为输入，返回的一些结构作为输出，通常为分析树或一组索引表示在字符串中成功停止分析的位置。分析器组合子使用递归下降分析战略，提倡模块式建造和测试。这种分析技术是所谓的组合分析。使用组合子构建的分析器易于构造、可读、模块化、结构良好且易于维护它们被广泛地用于领域特定语言（如数据库的自然语言接口）的编译器和处理器的原型设计中，在这些语言中，复杂多样的语义操作与语法处理紧密集成。1989年，Richard Frost和John Launchbury演示了使用语法分析组合子构造的自然语言解释器。Graham Hutton在1992年也使用了高阶函数进行基本解析。S.D. Swierstra在2001年还展示了解析器组合器的实用方面。在2008年，Frost、Hafiz和Callaghan用Haskell中描述了一组语法分析组合子，它们解决了长期存在的通用左递归的问题，它也是一个完整的，只需要多项式时间、空间的自顶向下解析工具。 (zh) In computer programming, a parser combinator is a higher-order function that 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 that facilitates modular piecewise construction and testing. This parsing technique is called combinatory parsing. (en)
dct:subject	Functional programming Formal languages Parsing
Wikipage page ID	16728666 (xsd:integer)
Wikipage revision ID	1105932348 (xsd:integer)
Link from a Wikipage to another Wikipage	Python (programming language) Memoization Natural language processing Infix Common Lisp Context-free grammar Rust (programming language) Go (programming language) Monad (functional programming) LL parser Computer programming Operator overloading Functional programming C Sharp (programming language) TypeScript Domain-specific language Ambiguous grammar F Sharp (programming language) Formal grammar Left recursion Recursive descent parser Haskell Higher-order function JavaScript Java (programming language) Formal languages Parsing Swift (programming language) Parse tree Top-down parsing Polynomial time R (programming language) Exponential time First-class function Parser Natural language user interface Recursive descent parsing
Link from a Wikipage to an external page	http://www.haskell.org/haskellwiki/Parsec http://www.quanttec.com/fparsec/ https://godoc.org/github.com/prataprc/goparsec http://cs.uwindsor.ca/~hafiz/pub/p46-frost.pdf%7Cjournal=ACM http://cs.uwindsor.ca/~richard/PUBLICATIONS/AI_03.pdf%7Cjournal=Proceedings http://cs.uwindsor.ca/~richard/PUBLICATIONS/SCOMP_96.pdf%7Cjournal=Sci. https://archive.org/details/recursiveprogram0000burg%7Curl-access=registration%7Clast=Burge%7Cfirst=William https://github.com/Geal/nom https://github.com/Ramarren/cl-parser-combinators https://github.com/chappers/Ramble https://github.com/francisrstokes/arcsecond https://github.com/jparsec/jparsec https://github.com/kyouko-taiga/Diesel https://github.com/louthy/csharp-monad https://github.com/microsoft/ts-parsec https://web.archive.org/web/20130606162214/https:/courses.cit.cornell.edu/ling4424/frost-launchbury.pdf%7Carchive-date=2013-06-06%7Cdoi-access=free http://www.staff.science.uu.nl/~swier101/Papers/2000/HaskellWorkshop.pdf%7Cjournal=Electronic https://pypi.org/project/pyparsing/ https://courses.cit.cornell.edu/ling4424/frost-launchbury.pdf%7Cjournal=The
sameAs	Parser combinator Parser combinator Parser combinator Parser combinator Parser combinator Parser combinator
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_journal dbt:Refbegin dbt:Refend dbt:Reflist dbt:Sfn dbt:Short_description dbt:Parsers
has abstract	In computer programming, a parser combinator is a higher-order function that 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 that facilitates modular piecewise construction and testing. This parsing technique is called combinatory parsing. Parsers using combinators 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 and monadic parsing in 1996. 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. (en) 在计算机编程中语法分析组合子是一个高阶函数，它接受几个的语法分析器作为输入，并返回一个新的语法分析函器作为其输出。在这个上下文中，语法分析器是一个函数，它接受字符串作为输入，返回的一些结构作为输出，通常为分析树或一组索引表示在字符串中成功停止分析的位置。分析器组合子使用递归下降分析战略，提倡模块式建造和测试。这种分析技术是所谓的组合分析。使用组合子构建的分析器易于构造、可读、模块化、结构良好且易于维护它们被广泛地用于领域特定语言（如数据库的自然语言接口）的编译器和处理器的原型设计中，在这些语言中，复杂多样的语义操作与语法处理紧密集成。1989年，Richard Frost和John Launchbury演示了使用语法分析组合子构造的自然语言解释器。Graham Hutton在1992年也使用了高阶函数进行基本解析。S.D. Swierstra在2001年还展示了解析器组合器的实用方面。在2008年，Frost、Hafiz和Callaghan用Haskell中描述了一组语法分析组合子，它们解决了长期存在的通用左递归的问题，它也是一个完整的，只需要多项式时间、空间的自顶向下解析工具。 (zh)
gold:hypernym	Function
prov:wasDerivedFrom	wikipedia-en:Parser_combinator?oldid=1105932348&ns=0
page length (characters) of wiki page	14642 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Parser_combinator
is Link from a Wikipage to another Wikipage of	Parsing expression grammar Parsec (parser) Left recursion Recursive descent parser Top-down parsing Parser Combinator Parser Combinators Parser combinators Combinator parser Combinatory parsing

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 49 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software