Parser combinator
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.
genre
genre
primaryTopic
Parser combinator
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.
has abstract
In computer programming, a par ...... in polynomial time and space.
@en
在计算机编程中 语法分析组合子 是一个 高阶函数 ,它接受几 ...... 它也是一个完整的,只需要多项式时间、空间的自顶向下解析工具。
@zh
Link from a Wikipage to an external page
Wikipage page ID
16,728,666
page length (characters) of wiki page
Wikipage revision ID
1,021,960,468
Link from a Wikipage to another Wikipage
bot
InternetArchiveBot
@en
date
January 2021
@en
fix-attempted
yes
@en
wikiPageUsesTemplate
hypernym
type
comment
In computer programming, a par ...... is called combinatory parsing.
@en
在计算机编程中 语法分析组合子 是一个 高阶函数 ,它接受几 ...... 它也是一个完整的,只需要多项式时间、空间的自顶向下解析工具。
@zh
label
Parser combinator
@en
语法分析组合子
@zh