Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q32271> ?p ?o }
Showing triples 1 to 57 of
57
with 100 triples per page.
- Q32271 subject Q7142640.
- Q32271 subject Q8217390.
- Q32271 abstract "In computer science, a parsing expression grammar, or PEG, is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of rules for recognizing strings in the language. The formalism was introduced by Bryan Ford in 2004 and is closely related to the family of top-down parsing languages introduced in the early 1970s.Syntactically, PEGs also look similar to context-free grammars (CFGs), but they have a different interpretation: the choice operator selects the first match in PEG, while it is ambiguous in CFG. This is closer to how string recognition tends to be done in practice, e.g. by a recursive descent parser.Unlike CFGs, PEGs cannot be ambiguous; if a string parses, it has exactly one valid parse tree. It is conjectured that there exist context-free languages that cannot be parsed by a PEG, but this is not yet proven. PEGs are well-suited to parsing computer languages, but not natural languages where their performance is comparable to general CFG algorithms such as the Earley algorithm.".
- Q32271 wikiPageExternalLink thesis.
- Q32271 wikiPageExternalLink packrat.
- Q32271 wikiPageExternalLink convert-a-string-expression-into-a-lambda-expression.
- Q32271 wikiPageExternalLink peg-slides.pdf.
- Q32271 wikiPageExternalLink grammar.
- Q32271 wikiPageWikiLink Q1047576.
- Q32271 wikiPageWikiLink Q11348.
- Q32271 wikiPageWikiLink Q1140419.
- Q32271 wikiPageWikiLink Q1159631.
- Q32271 wikiPageWikiLink Q1277497.
- Q32271 wikiPageWikiLink Q127992.
- Q32271 wikiPageWikiLink Q1323264.
- Q32271 wikiPageWikiLink Q1376168.
- Q32271 wikiPageWikiLink Q1514868.
- Q32271 wikiPageWikiLink Q165474.
- Q32271 wikiPageWikiLink Q1756442.
- Q32271 wikiPageWikiLink Q1760114.
- Q32271 wikiPageWikiLink Q179976.
- Q32271 wikiPageWikiLink Q18355607.
- Q32271 wikiPageWikiLink Q184754.
- Q32271 wikiPageWikiLink Q185612.
- Q32271 wikiPageWikiLink Q1917459.
- Q32271 wikiPageWikiLink Q192161.
- Q32271 wikiPageWikiLink Q194152.
- Q32271 wikiPageWikiLink Q21198.
- Q32271 wikiPageWikiLink Q2393193.
- Q32271 wikiPageWikiLink Q275603.
- Q32271 wikiPageWikiLink Q3121428.
- Q32271 wikiPageWikiLink Q33215.
- Q32271 wikiPageWikiLink Q33742.
- Q32271 wikiPageWikiLink Q338047.
- Q32271 wikiPageWikiLink Q3454656.
- Q32271 wikiPageWikiLink Q36350.
- Q32271 wikiPageWikiLink Q373045.
- Q32271 wikiPageWikiLink Q428414.
- Q32271 wikiPageWikiLink Q4943356.
- Q32271 wikiPageWikiLink Q504353.
- Q32271 wikiPageWikiLink Q5155950.
- Q32271 wikiPageWikiLink Q5196623.
- Q32271 wikiPageWikiLink Q627921.
- Q32271 wikiPageWikiLink Q6498784.
- Q32271 wikiPageWikiLink Q7139956.
- Q32271 wikiPageWikiLink Q7142640.
- Q32271 wikiPageWikiLink Q729271.
- Q32271 wikiPageWikiLink Q7662657.
- Q32271 wikiPageWikiLink Q7824365.
- Q32271 wikiPageWikiLink Q798554.
- Q32271 wikiPageWikiLink Q816022.
- Q32271 wikiPageWikiLink Q8217390.
- Q32271 wikiPageWikiLink Q932615.
- Q32271 wikiPageWikiLink Q954063.
- Q32271 wikiPageWikiLink Q954821.
- Q32271 comment "In computer science, a parsing expression grammar, or PEG, is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of rules for recognizing strings in the language.".
- Q32271 label "Parsing expression grammar".