About: Tail recursive parser

An Entity of Type: Rule105846932, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org:8891

In computer science, tail recursive parsers are a derivation from the more common recursive descent parsers. Tail recursive parsers are commonly used to parse left recursive grammars. They use a smaller amount of stack space than regular recursive descent parsers. They are also easy to write. Typical recursive descent parsers make parsing left recursive grammars impossible (because of an infinite loop problem). Tail recursive parsers use a node reparenting technique that makes this allowable.

Property	Value
dbo:abstract	In computer science, tail recursive parsers are a derivation from the more common recursive descent parsers. Tail recursive parsers are commonly used to parse left recursive grammars. They use a smaller amount of stack space than regular recursive descent parsers. They are also easy to write. Typical recursive descent parsers make parsing left recursive grammars impossible (because of an infinite loop problem). Tail recursive parsers use a node reparenting technique that makes this allowable. (en)
dbo:wikiPageExternalLink	http://www.drdobbs.com/cpp/184406384%3Fpgno=1
dbo:wikiPageID	4220694 (xsd:integer)
dbo:wikiPageLength	2744 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	969434603 (xsd:integer)
dbo:wikiPageWikiLink	dbr:META_II dbc:Parsing_algorithms dbr:Computer_science dbr:C_(programming_language) dbr:EBNF dbr:Left_recursion dbr:Recursive_descent_parser dbr:Abstract_syntax_tree
dbp:wikiPageUsesTemplate	dbt:Var dbt:Parsers
dcterms:subject	dbc:Parsing_algorithms
gold:hypernym	dbr:Derivation
rdf:type	yago:WikicatParsingAlgorithms yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Event100029378 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Rule105846932
rdfs:comment	In computer science, tail recursive parsers are a derivation from the more common recursive descent parsers. Tail recursive parsers are commonly used to parse left recursive grammars. They use a smaller amount of stack space than regular recursive descent parsers. They are also easy to write. Typical recursive descent parsers make parsing left recursive grammars impossible (because of an infinite loop problem). Tail recursive parsers use a node reparenting technique that makes this allowable. (en)
rdfs:label	Tail recursive parser (en)
owl:sameAs	freebase:Tail recursive parser yago-res:Tail recursive parser wikidata:Tail recursive parser dbpedia-fa:Tail recursive parser https://global.dbpedia.org/id/fyAo dbr:Tail recursive parser
prov:wasDerivedFrom	wikipedia-en:Tail_recursive_parser?oldid=969434603&ns=0
foaf:isPrimaryTopicOf	wikipedia-en:Tail_recursive_parser
is dbo:wikiPageRedirects of	dbr:Tail_Recursive_Parser
is dbo:wikiPageWikiLink of	dbr:Tail_Recursive_Parser dbr:Recursive_descent_parser
is foaf:primaryTopic of	wikipedia-en:Tail_recursive_parser