「CONTEXT-FREE」の共起表現一覧(1語右で並び替え)
該当件数 : 65件
| language ALGOL 60 was formalised using the | context-free Backus-Naur form. |
| All regular, | context-free, context-sensitive and recursive languages |
| A simple precedence grammar is a | context-free formal grammar that can be parsed with a si |
| Stochastic | context-free grammar |
| Every | context-free grammar can be transformed into an equivale |
| It uses a | context-free grammar to form all elements of the papers. |
| A language is specified using a | context-free grammar which is expressed using Extended B |
| The following is a simple | Context-free grammar which can describe a language made |
| shdown automaton that is generated from the | context-free grammar of the language to be parsed. |
| rm of rule to be permitted, in which case a | context-free grammar that can generate the empty word ca |
| puter science and formal language theory, a | context-free grammar is in Greibach normal form if the r |
| In computer science, a | context-free grammar is said to be an ambiguous grammar |
| A production-rule of a | context-free grammar (CFG) may have one or more ‘alterna |
| Van Wijngaarden grammars use a | context-free grammar to generate an infinite set of prod |
| y a deterministic parser (see deterministic | context-free grammar) but nondeterministic parsing impos |
| Matrix grammar is an extension of | context-free grammar, and one instance of a Controlled g |
| Such rules form a | context-free grammar. |
| Such rules have been proved to form a | Context-free grammar. |
| production probabilities in a probabilistic | context-free grammar. |
| h are rules generating the productions of a | context-free grammar. |
| n number of some terminals is accepted by a | context-free grammar. |
| In formal grammar theory, the deterministic | context-free grammars (DCFGs) are a proper subset of the |
| The deterministic | context-free grammars are those a deterministic pushdown |
| But using | context-free grammars to help automate the parsing part |
| ion in compilers, and to augment regular or | context-free grammars with context-sensitive conditions; |
| Context-free grammars are those grammars in which the le | |
| xt-sensitive grammars are more general than | context-free grammars but still orderly enough to be par |
| d finite automata led to the discovery that | context-free grammars are equivalent to pushdown automat |
| Deterministic | context-free grammars were particularly useful because t |
| lattice (AGFL) formalism is a notation for | context-free grammars with finite set-valued features, a |
| ed above are good examples of how to extend | context-free grammars with some kind of control mechanis |
| Synchronous | context-free grammars (SynCFG or SCFG; not to be confuse |
| here their ability to parse using arbitrary | Context-free grammars eases the task of writing the gram |
| stic and non-deterministic) for all kind of | context-free grammars (CFG) as well as some classes of c |
| lisms (TAG, RCG) or formalisms that rely on | context-free grammars and are extended thanks to attribu |
| ax of natural languages can be described by | context-free grammars (written as ID/LP grammars), with |
| They extend the basic type of grammars, the | context-free grammars, with a conjunction operation. |
| Syntax analysis (including | context-free grammars, LL parsers, bottom-up parsers, an |
| ne example is the CKY parsing algorithm for | context-free grammars, an example of dynamic programming |
| junctive grammars are greater than those of | context-free grammars, conjunctive grammars retain some |
| (in terms of weak generative capacity) than | context-free grammars, but less powerful than indexed or |
| r class used by Lithe properly contains all | context-free grammars, a wide variety of syntax can be d |
| vial; not all languages can be generated by | context-free grammars. |
| nology, enabling it to handle all practical | context-free grammars. |
| grammars (LR, LALR, RLR) as well as general | context-free grammars. |
| the only logical connective expressible in | context-free grammars. |
| ation on hidden Markov models to stochastic | context-free grammars. |
| Every | context-free language is context-sensitive. |
| The simplest | context-free language in the Chomsky hierarchy; |
| A | context-free language is inherently ambiguous if all con |
| conversion can be used to prove that every | context-free language can be accepted by a non-determini |
| erform a reduction or return an error) of a | context-free language is a regular language, so the pars |
| ber of occurrences of terminal symbols in a | context-free language, without regard to their order, th |
| ll-formed expressions in some deterministic | context-free language. |
| Supports the entire range of | context-free languages |
| Context-free languages are the theoretical basis for the | |
| The pumping lemma for | context-free languages, also known as the Bar-Hillel lem |
| omsky hierarchy, the regular languages, the | context-free languages, and the recursively enumerable l |
| Those that can are called | context-free languages. |
| nite languages (which are regular and hence | context-free) obey the pumping lemma trivially by having |
| ntly, there are generalizations of the main | context-free parsing algorithms, including the linear-ti |
| context-free priorities | |
| context-free syntax | |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
