-
1 parse tree
дерево синтаксического анализа
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > parse tree
-
2 parse tree
= parsing tree tree дерево синтаксического анализа -
3 parse tree
дерево [синтаксического] разбораАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > parse tree
-
4 parse tree
1) Техника: дерево синтаксического анализа2) Лингвистика: дерево парсинга3) Программирование: дерево (синтаксического) разбора -
5 parse tree
درخت تجزيه -
6 parse tree
stablo raÅ¡Älambe -
7 parse tree
• drvo raščlanjenja -
8 parse tree
• jäsennyspuu -
9 parse tree
ontledingsboom -
10 parse tree
s.árbol sintáctico, árbol de análisis sintáctico. -
11 parse tree
-
12 parse tree representation
представление в виде дерева грамматического разбораБольшой англо-русский и русско-английский словарь > parse tree representation
-
13 parse tree representation
Вычислительная техника: представление в виде дерева грамматического разбораУниверсальный англо-русский словарь > parse tree representation
-
14 parse tree representation
English-Russian dictionary of computer science and programming > parse tree representation
-
15 internal node of a parse tree
Математика: внутренняя вершина дерева разбораУниверсальный англо-русский словарь > internal node of a parse tree
-
16 tree
1) вчт древовидная схема; древовидный дешифратор2) дерево (напр. графа) || древовидный3) крист. дендрит•- tree of given weight
- tree of objectives
- tree of statements
- abstract syntax tree
- adaptive tree
- Adel'son-Vel'ski-Landis tree
- Aronshine tree
- AVL tree
- B-tree
- balanced tree
- bifurcation tree
- binary tree
- binary searchtree
- Boolean tree
- branching tree
- Cartesian tree
- Cayley tree
- choice tree
- classification tree
- classification and regression tree
- clock tree
- cluster tree
- co-tree
- code tree
- command tree
- complement tree
- complete code tree
- computation tree
- conference tree
- countable tree
- decision tree
- decomposition tree
- deduction tree
- derivation tree
- edge-rooted tree
- equipotential tree
- existence trie tree
- fault tree
- Feigenbaum tree
- Fibonacci tree
- finite tree
- fractal tree
- game tree
- generation tree
- graph tree
- hardware tree
- hierarchical tree
- homeomorphically irreducible tree
- Husimi tree
- hypothesis search tree
- inference tree
- information tree
- labeled tree
- language tree
- lexicographic tree
- loaded fractal tree
- logical tree
- minimal tree
- minimal length tree
- multibranch tree
- multiway tree
- normal tree
- optimal tree
- optimal merge tree
- optimal search tree
- ordered tree
- oriented tree
- outcome tree
- parse tree
- parsing tree
- patricia tree
- planar tree
- plane tree
- priority tree
- priority search tree
- probability tree
- production tree
- proper tree
- proof tree
- radix tree
- randomized binary tree
- RB tree
- recursive tree
- red-black tree
- response tree
- rooted tree
- search tree
- selection tree
- shortest tree
- shortest-distance tree
- signed tree
- spanning tree
- specific tree
- subject tree
- subspanning tree
- suffix tree
- symmetric tree
- syntax tree
- ternary tree
- ternary search tree
- threaded tree
- topological tree
- transition tree
- trie tree
- two-color tree
- two-dimensional tree
- two-level tree
- unlabeled tree
- weighted tree -
17 tree
древовидная схема, дерево1) дерево - граф, в котором существует единственный путь между двумя вершинами, т. е. связанный ациклический граф2) концептуальное или графическое представление данных, организованных в древовидную структуру, например дерево каталогов на дискеАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > tree
-
18 parsing tree
-
19 derivation tree
Syn:см. тж. context-free grammarдерево, отражающее процедуру логического вывода; его вершинами являются или исходные формулы, или формулы, полученные в процессе вывода.Syn:Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > derivation tree
-
20 syntax tree
дерево грамматического разбора, синтаксическое деревоконкретная реализация в компиляторе дерева грамматического разбора обозначается термином parse treeсм. тж. syntax ruleАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > syntax tree
- 1
- 2
См. также в других словарях:
Parse tree — For the trees used in computer science, see Abstract syntax tree. A concrete syntax tree or parse tree or parsing tree[1] is an ordered, rooted tree that represents the syntactic structure of a string according to some formal grammar. In a parse… … Wikipedia
Tree diagram — The term tree diagram is used in different ways in different disciplines. * In mathematics and statistical methods, a tree diagram is used to determine the probability of getting specific results where the possibilities are nested.… … Wikipedia
XL (programming language) — XL stands for eXtensible Language. It is a computer programming language designed to support concept programming.XL features programmer reconfigurable syntax and semantics. Compiler plug ins can be used to add new features to the language. A base … Wikipedia
Non-terminal function — A non terminal function is a function (node) in a parse tree which is either a root or a branch in that tree. Background A parse tree is made up of nodes and branches. In the picture below the parse tree is the entire structure, starting from S… … Wikipedia
Terminal function — A terminal function is a function (node) in a parse tree which is a leaf in that parse tree. Background A parse tree is made up of nodes and branches. In the picture below the parse tree is the entire structure, starting from S and ending in each … Wikipedia
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
Memoization — Not to be confused with Memorization. In computing, memoization is an optimization technique used primarily to speed up computer programs by having function calls avoid repeating the calculation of results for previously processed inputs.… … Wikipedia
LL parser — An LL parser is a top down parser for a subset of the context free grammars. It parses the input from Left to right, and constructs a Leftmost derivation of the sentence (hence LL, compared with LR parser). The class of grammars which are… … Wikipedia
CYK algorithm — The Cocke–Younger–Kasami (CYK) algorithm (alternatively called CKY) is a parsing algorithm for context free grammars. It employs bottom up parsing and dynamic programming. The standard version of CYK operates only on context free grammars given… … Wikipedia
Bottom-up parsing — (also known as shift reduce parsing) is a strategy for analyzing unknown data relationships that attempts to identify the most fundamental units first, and then to infer higher order structures from them. It attempts to build trees upward toward… … Wikipedia
Parser Grammar Engine — The Parser Grammar Engine (originally Parrot Grammar Engine) or PGE is a compiler and runtime for a Perl 6 rules for the Parrot virtual machine. [cite web | url=http://search.cpan.org/ ltoetsch/parrot 0.2.2/compilers/pge/README | title=Parrot… … Wikipedia
