-
1 parsing table
Большой англо-русский и русско-английский словарь > parsing table
-
2 parsing table
English-Russian dictionary of computer science and programming > parsing table
-
3 table
1) таблица•- accuracy table
- add table
- addition table
- address table
- aligned table
- area table
- autotest table
- available device table
- base table
- Boolean operation table
- boxed table
- bundle table
- checking table
- CMOS table
- color-translation table
- configuration table
- contingency table
- conversion table
- correction table
- cross-reference table
- decision table
- difference table
- equivalent table
- file allocation table
- first entry table
- form table
- four-digit table
- frame table
- frequency table
- function table
- hashed table
- hash table
- header table
- job accouting table
- job control table - light table
- loop-at table
- loop-up table
- mapping table
- matrix table
- multiplication table
- name table
- nested table
- next entry table
- offset table
- on-screen table
- operation table
- operational table
- output table
- page frame table
- page table
- parsing table
- partition table
- plotting table
- polarization table
- polling table
- precedence table
- priority interrupt table
- program reference table
- public volume table
- relative track address table
- relocation dictionary table
- relocation factor table
- relocation table
- routing table
- security table
- segment table
- servo plotting table
- set-used table
- shadow page table
- site status table
- state table
- structure table
- symbol table
- terminal table
- trace table
- transfer table
- transition table
- translation table
- truth table
- two-input table
- usability table
- user profile table
- visual table of contents
- volume table of contents
- X-Y tableEnglish-Russian dictionary of computer science and programming > table
-
4 таблица синтаксического анализа
Большой англо-русский и русско-английский словарь > таблица синтаксического анализа
-
5 memoization
в ВТ - разновидность кэширования (caching), буферизации (buffering) или использования просмотровых таблиц (lookup table); способ оптимизации, применяемый преимущественно для ускорения выполнения программ (но за счёт дополнительных затрат памяти): предусматривает запоминание результатов вычисления функций, с тем чтобы при последующем вызове функции при тех же входных данных можно было не повторять вычисления, а сразу выбирать результаты. Этот же подход может использоваться в других ситуациях, например при парсинге (parsing). В контексте некоторых языков логического программированияSyn:tabling. Сам термин memoization предложил в 1968 г. Дональд Мичи - от лат. memorandum (to be remembered, для запоминания), со специфическим для ВТ значением "превращение результатов [вычисления функции] в нечто запоминающееся". Не следует смешивать с очень похожим более общим термином memorizationАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > memoization
См. также в других словарях:
Parsing table — A parsing table is the part of a parser that makes decisions about how to treat input tokens in compiler development.: This page is about LR parsing tables, there are also LL parsing tables which are substantially different. Overview A parsing… … 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
Control table — This simple control table directs program flow according to the value of the single input variable. Each table entry holds a possible input value to be tested for equality (implied) and a relevant subroutine to perform in the action column. The… … 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
LR parser — In computer science, an LR parser is a parser for context free grammars that reads input from Left to right and produces a Rightmost derivation. The term LR( k ) parser is also used; here the k refers to the number of unconsumed look ahead input… … 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
LALR parser — In computer science, a lookahead LR parser or LALR parser is a specialized form of LR parser that can deal with more context free grammars than Simple LR (SLR) parsers. It is a very popular type of parser because it gives a good trade off between … Wikipedia
Simple precedence parser — In computer science, a Simple precedence parser is a type of bottom up parser for context free grammars that can be used only by Simple precedence grammars.The implementation of the parser is quite similar to the generic bottom up parser. A stack … 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
GOLD (parser) — Infobox Software name = GOLD Parsing System caption = developer = Devin Cook [http://www.devincook.com/goldparser/contributors Multiple Contributors] latest release date = 2007 07 29 latest release version = 3.4.4 operating system = Windows… … Wikipedia
Index (search engine) — Search engine indexing collects, parses, and stores data to facilitate fast and accurate information retrieval. Index design incorporates interdisciplinary concepts from linguistics, cognitive psychology, mathematics, informatics, physics, and… … Wikipedia