再帰下降構文解析
1. Recursive descent parserIn 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.
Read “Recursive descent parser” on English Wikipedia
Read “再帰下降構文解析” on Japanese Wikipedia
Read “Recursive descent parser” on DBpedia
Read “Recursive descent parser” on English Wikipedia
Read “再帰下降構文解析” on Japanese Wikipedia
Read “Recursive descent parser” on DBpedia
Discussions
Log in to talk about this word.