Data Portal @ linkeddatafragments.org

Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Recursive_descent_parser> ?p ?o. }

• Recursive_descent_parser abstract "In computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent) where each such procedure usually implements one of the production rules of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes.A predictive parser is a recursive descent parser that does not require backtracking. Predictive parsing is possible only for the class of LL(k) grammars, which are the context-free grammars for which there exists some positive integer k that allows a recursive descent parser to decide which production to use by examining only the next k tokens of input. (The LL(k) grammars therefore exclude all ambiguous grammars, as well as all grammars that contain left recursion. Any context-free grammar can be transformed into an equivalent grammar that has no left recursion, but removal of left recursion does not always yield an LL(k) grammar.) A predictive parser runs in linear time.Recursive descent with backtracking is a technique that determines which production to use by trying each production in turn. Recursive descent with backtracking is not limited to LL(k) grammars, but is not guaranteed to terminate unless the grammar is LL(k). Even when they terminate, parsers that use recursive descent with backtracking may require exponential time.Although predictive parsers are widely used, and are frequently chosen if writing a parser by hand, programmers often prefer to use a table-based parser produced by a parser generator, either for an LL(k) language or using an alternative parser, such as LALR or LR. This is particularly the case if a grammar is not in LL(k) form, as transforming the grammar to LL to make it suitable for predictive parsing is involved. Predictive parsers can also be automatically generated, using tools like ANTLR.Predictive parsers can be depicted using transition diagrams for each non-terminal symbol where the edges between the initial and the final states are labelled by the symbols (terminals and non-terminals) of the right side of the production rule.".
• Recursive_descent_parser wikiPageExternalLink crenshaw.
• Recursive_descent_parser wikiPageExternalLink simple-top-down-parsing.htm.
• Recursive_descent_parser wikiPageExternalLink jparsec.codehaus.org.
• Recursive_descent_parser wikiPageExternalLink math-parser-part-3-implementation.
• Recursive_descent_parser wikiPageExternalLink 421649.html.
• Recursive_descent_parser wikiPageExternalLink pyparsing.sourceforge.net.
• Recursive_descent_parser wikiPageExternalLink bnf2xml.
• Recursive_descent_parser wikiPageExternalLink recursive_decent_parsing.html.
• Recursive_descent_parser wikiPageExternalLink pearl.pdf.
• Recursive_descent_parser wikiPageExternalLink index.mp.
• Recursive_descent_parser wikiPageExternalLink Parse::RecDescent.
• Recursive_descent_parser wikiPageID "70089".
• Recursive_descent_parser wikiPageRevisionID "598260973".
• Recursive_descent_parser hasPhotoCollection Recursive_descent_parser.
• Recursive_descent_parser subject Category:Articles_with_example_C_code.
• Recursive_descent_parser subject Category:Parsing_algorithms.
• Recursive_descent_parser type Abstraction100002137.
• Recursive_descent_parser type Act100030358.
• Recursive_descent_parser type Activity100407535.
• Recursive_descent_parser type Algorithm105847438.
• Recursive_descent_parser type Event100029378.
• Recursive_descent_parser type ParsingAlgorithms.
• Recursive_descent_parser type Procedure101023820.
• Recursive_descent_parser type PsychologicalFeature100023100.
• Recursive_descent_parser type Rule105846932.
• Recursive_descent_parser type YagoPermanentlyLocatedEntity.
• Recursive_descent_parser comment "In computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent) where each such procedure usually implements one of the production rules of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes.A predictive parser is a recursive descent parser that does not require backtracking.".
• Recursive_descent_parser label "Analisador sintático descendente recursivo".
• Recursive_descent_parser label "Recursive descent parser".
• Recursive_descent_parser label "Rekursiver Abstieg".
• Recursive_descent_parser label "Метод рекурсивного спуска".
• Recursive_descent_parser label "الترميز التكراري النموذجي".
• Recursive_descent_parser label "再帰下降構文解析".
• Recursive_descent_parser sameAs Rekursiver_Abstieg.
• Recursive_descent_parser sameAs 再帰下降構文解析.
• Recursive_descent_parser sameAs 되부름_하향_구문_분석.
• Recursive_descent_parser sameAs Analisador_sintático_descendente_recursivo.
• Recursive_descent_parser sameAs m.0j69t.
• Recursive_descent_parser sameAs Q1323264.
• Recursive_descent_parser sameAs Q1323264.
• Recursive_descent_parser sameAs Recursive_descent_parser.
• Recursive_descent_parser wasDerivedFrom Recursive_descent_parser?oldid=598260973.
• Recursive_descent_parser isPrimaryTopicOf Recursive_descent_parser.