Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Recursive_ascent_parser> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- Recursive_ascent_parser 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.".
- Recursive_ascent_parser wikiPageExternalLink citation.cfm?id=13310.13326.
- Recursive_ascent_parser wikiPageID "18344532".
- Recursive_ascent_parser wikiPageRevisionID "603433613".
- Recursive_ascent_parser hasPhotoCollection Recursive_ascent_parser.
- Recursive_ascent_parser subject Category:Parsing_algorithms.
- Recursive_ascent_parser type Abstraction100002137.
- Recursive_ascent_parser type Act100030358.
- Recursive_ascent_parser type Activity100407535.
- Recursive_ascent_parser type Algorithm105847438.
- Recursive_ascent_parser type Event100029378.
- Recursive_ascent_parser type ParsingAlgorithms.
- Recursive_ascent_parser type Procedure101023820.
- Recursive_ascent_parser type PsychologicalFeature100023100.
- Recursive_ascent_parser type Rule105846932.
- Recursive_ascent_parser type YagoPermanentlyLocatedEntity.
- Recursive_ascent_parser 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.".
- Recursive_ascent_parser label "Recursive ascent parser".
- Recursive_ascent_parser sameAs m.04dzkpy.
- Recursive_ascent_parser sameAs Q7303337.
- Recursive_ascent_parser sameAs Q7303337.
- Recursive_ascent_parser sameAs Recursive_ascent_parser.
- Recursive_ascent_parser wasDerivedFrom Recursive_ascent_parser?oldid=603433613.
- Recursive_ascent_parser isPrimaryTopicOf Recursive_ascent_parser.