Geben Sie ein Wort oder eine Phrase in einer beliebigen Sprache ein 👆
Sprache:
Übersetzung und Analyse von Wörtern durch künstliche Intelligenz ChatGPT
Auf dieser Seite erhalten Sie eine detaillierte Analyse eines Wortes oder einer Phrase mithilfe der besten heute verfügbaren Technologie der künstlichen Intelligenz:
- wie das Wort verwendet wird
- Häufigkeit der Nutzung
- es wird häufiger in mündlicher oder schriftlicher Rede verwendet
- Wortübersetzungsoptionen
- Anwendungsbeispiele (mehrere Phrasen mit Übersetzung)
- Etymologie
Was (wer) ist recursive descent - definition
Recursive descent parser
ALGORITHM
Recursive descent; Recursive-descent parsers; Recursive descent parsers; Recursive-descent parser; Predictive parser; Recursive descent parsing; Predictive parsing; Recursive parser
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 implements one of the nonterminals of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes.
recursive descent parser
ALGORITHM
Recursive descent; Recursive-descent parsers; Recursive descent parsers; Recursive-descent parser; Predictive parser; Recursive descent parsing; Predictive parsing; Recursive parser
<grammar> A "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
productions of the grammar. Thus the structure of the
resulting program closely mirrors that of the grammar it
recognises.
["Recursive Programming Techniques", W.H. Burge, 1975, ISBN
0-201-14450-6 ].
(1995-04-28)
General recursive function
ONE OF SEVERAL EQUIVALENT DEFINITIONS OF A COMPUTABLE FUNCTION
Partial recursive function; Total recursive function; Mu-recursive; Mu recursive function; Mu-recursive function; Recursive function theory; M-recursive function; Μ recursion; General-recursive; General recursive; Recursive function (computability); Μ-recursive function; Μ-recursive
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. If the function is total, it is also called a total recursive function (sometimes shortened to recursive function).
