“parsing”的概念、定义、翻译、参考文献-科学参考

parsing

Computer

The process of deciding whether a string of input symbols is a sentence of a given language and if so determining the syntactic structure of the string as defined by a grammar (usually context-free) for the language. This is achieved by means of a program known as a parser or syntax analyser. For example, a syntax analyser of arithmetic expressions should report an error in the string
$1 - + 2$
since the juxtaposition of the minus and plus operators is invalid. On the other hand the string
$1 – 2 – 3$
is a valid arithmetic expression with structure specified by the statement that its subexpressions are
$1, 2, 3 and 1 – 2$
(Note that 2–3 is not a subexpression.)
The input to a parser is a string of tokens supplied by a lexical analyser. Its output may be in the form of a parse tree or a derivation sequence. See also bottom-up parsing, precedence parsing, top-down parsing.

Philosophy

The process of determining the syntactic or grammatical structure of a sentence. The interesting philosophical point is that for natural languages, this process is extremely difficult to do explicitly. Yet ordinary speakers have no difficulty recognizing grammaticality, nor the way in which words and other features of sentences contribute to their structure. This raises the question of whether it is right to think in terms of tacit or implicit deployment of rules, or whether our ordinary knowledge is better thought of in some other way.

单词	parsing
释义	parsing Computer The process of deciding whether a string of input symbols is a sentence of a given language and if so determining the syntactic structure of the string as defined by a grammar (usually context-free) for the language. This is achieved by means of a program known as a parser or syntax analyser. For example, a syntax analyser of arithmetic expressions should report an error in the string $1 - + 2$ since the juxtaposition of the minus and plus operators is invalid. On the other hand the string $1 – 2 – 3$ is a valid arithmetic expression with structure specified by the statement that its subexpressions are $1, 2, 3 and 1 – 2$ (Note that 2–3 is not a subexpression.) The input to a parser is a string of tokens supplied by a lexical analyser. Its output may be in the form of a parse tree or a derivation sequence. See also bottom-up parsing, precedence parsing, top-down parsing. Philosophy The process of determining the syntactic or grammatical structure of a sentence. The interesting philosophical point is that for natural languages, this process is extremely difficult to do explicitly. Yet ordinary speakers have no difficulty recognizing grammaticality, nor the way in which words and other features of sentences contribute to their structure. This raises the question of whether it is right to think in terms of tacit or implicit deployment of rules, or whether our ordinary knowledge is better thought of in some other way.
随便看	policy instrument polis Polish Corridor polished section polished stone value polishing polishing relief Polish logic Polish notation Polish Succession, War of the (1733–38) Politburo political business cycle political ecology political economy political geography politics of place politics, philosophy of polje Polk, James Knox (1795–1849) Pollaczek–Khintchine formula pollen pollen analysis pollen-assemblage zone pollen diagram pollen sac