Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7303337> ?p ?o }
Showing triples 1 to 17 of
17
with 100 triples per page.
- Q7303337 subject Q8217390.
- Q7303337 abstract "In computer science, recursive ascent parsing is a technique for implementing an LALR parser which uses mutually-recursive functions rather than tables. Thus, the parser is directly encoded in the host language similar to recursive descent. Direct encoding usually yields a parser which is faster than its table-driven equivalent for the same reason that compilation is faster than interpretation. It is also (nominally) possible to hand edit a recursive ascent parser, whereas a tabular implementation is nigh unreadable to the average human.Recursive ascent was first described by Thomas Penello in his article in 1986. He was not intending to create a hand-editable implementation of an LR parser, but rather a maintainable and efficient parser implemented in assembly language. The technique was later expounded upon by G.H. Roberts in 1988 as well as in an article by Leermakers, Augusteijn, Kruseman Aretz in 1992 in the journal Theoretical Computer Science. An extremely readable description of the technique was written by Morell and Middleton in 2003. A good exposition can also be found in a TOPLAS article by Sperber and Thiemann.Recursive ascent has also been merged with recursive descent, yielding a technique known as recursive ascent/descent. This implementation technique is arguably easier to hand-edit due to the reduction in states and fact that some of these states are more intuitively top-down rather than bottom up. It can also yield some minimal performance improvements over conventional recursive ascent.".
- Q7303337 wikiPageExternalLink citation.cfm?id=13310.13326.
- Q7303337 wikiPageWikiLink Q1071969.
- Q7303337 wikiPageWikiLink Q1076785.
- Q7303337 wikiPageWikiLink Q1204392.
- Q7303337 wikiPageWikiLink Q1322511.
- Q7303337 wikiPageWikiLink Q1323264.
- Q7303337 wikiPageWikiLink Q165436.
- Q7303337 wikiPageWikiLink Q1756442.
- Q7303337 wikiPageWikiLink Q176452.
- Q7303337 wikiPageWikiLink Q21198.
- Q7303337 wikiPageWikiLink Q373045.
- Q7303337 wikiPageWikiLink Q460584.
- Q7303337 wikiPageWikiLink Q8217390.
- Q7303337 comment "In computer science, recursive ascent parsing is a technique for implementing an LALR parser which uses mutually-recursive functions rather than tables. Thus, the parser is directly encoded in the host language similar to recursive descent. Direct encoding usually yields a parser which is faster than its table-driven equivalent for the same reason that compilation is faster than interpretation.".
- Q7303337 label "Recursive ascent parser".