parsing$514790$ - definizione. Che cos'è parsing$514790$
Diclib.com
Dizionario ChatGPT
Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:

Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT

In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:

  • come viene usata la parola
  • frequenza di utilizzo
  • è usato più spesso nel discorso orale o scritto
  • opzioni di traduzione delle parole
  • esempi di utilizzo (varie frasi con traduzione)
  • etimologia

Cosa (chi) è parsing$514790$ - definizione

Top-Down Parsing Language

Top-down parsing         
PARSING TECHNIQUE
Top-bottom parsing; Top-down parser; Top down parsing
Top-down parsing in computer science is a parsing strategy where one first looks at the highest level of the parse tree and works down the parse tree by using the rewriting rules of a formal grammar. LL parsers are a type of parser that uses a top-down parsing strategy.
parse         
  • Flow of data in a typical parser
  •  url=https://archive.org/details/cprogramminglang00bria }} (Appendix A.13 "Grammar", p.193 ff)</ref> ''Bottom:'' a parser has digested the tokens "<syntaxhighlight lang="c" inline>int v;main(){</syntaxhighlight>" and is about choose a rule to derive ''Stmt''. Looking only at the first lookahead token "<syntaxhighlight lang="c" inline>v</syntaxhighlight>", it cannot decide which of both alternatives for ''Stmt'' to choose; the latter requires peeking at the second token.
PROCESS OF ANALYZING A STRING OF SYMBOLS, EITHER IN NATURAL LANGUAGE, COMPUTER LANGUAGES OR DATA STRUCTURES, CONFORMING TO THE RULES OF A FORMAL GRAMMAR
Syntax analysis; Syntactical analysis; Parsers; Parseable; Parsing (human languages); Syntactic Analysis; Syntactic analysis; Parser 3; Parser; Parse; Syntactic parsing; Grammar parser; Parsable; Natural language parsing; Parsed; HTML parser; Natural language parser; List of parser development software; Parsing algorithms; Parsing algorithm; English parser; SyntaxNet; Parsing of natural language; Lookahead (parsing); Parsers for natural languages; Graph parsing; Mechanical layout
(parses, parsing, parsed)
In grammar, if you parse a sentence, you examine each word and clause in order to work out what grammatical type each one is. (TECHNICAL)
VERB: V n
Parsing         
  • Flow of data in a typical parser
  •  url=https://archive.org/details/cprogramminglang00bria }} (Appendix A.13 "Grammar", p.193 ff)</ref> ''Bottom:'' a parser has digested the tokens "<syntaxhighlight lang="c" inline>int v;main(){</syntaxhighlight>" and is about choose a rule to derive ''Stmt''. Looking only at the first lookahead token "<syntaxhighlight lang="c" inline>v</syntaxhighlight>", it cannot decide which of both alternatives for ''Stmt'' to choose; the latter requires peeking at the second token.
PROCESS OF ANALYZING A STRING OF SYMBOLS, EITHER IN NATURAL LANGUAGE, COMPUTER LANGUAGES OR DATA STRUCTURES, CONFORMING TO THE RULES OF A FORMAL GRAMMAR
Syntax analysis; Syntactical analysis; Parsers; Parseable; Parsing (human languages); Syntactic Analysis; Syntactic analysis; Parser 3; Parser; Parse; Syntactic parsing; Grammar parser; Parsable; Natural language parsing; Parsed; HTML parser; Natural language parser; List of parser development software; Parsing algorithms; Parsing algorithm; English parser; SyntaxNet; Parsing of natural language; Lookahead (parsing); Parsers for natural languages; Graph parsing; Mechanical layout
Parsing, syntax analysis, or syntactic analysis is the process of analyzing a string of symbols, either in natural language, computer languages or data structures, conforming to the rules of a formal grammar. The term parsing comes from Latin pars (orationis), meaning part (of speech).

Wikipedia

Top-down parsing language

Top-Down Parsing Language (TDPL) is a type of analytic formal grammar developed by Alexander Birman in the early 1970s in order to study formally the behavior of a common class of practical top-down parsers that support a limited form of backtracking. Birman originally named his formalism the TMG Schema (TS), after TMG, an early parser generator, but it was later given the name TDPL by Aho and Ullman in their classic anthology The Theory of Parsing, Translation and Compiling.