DE eng

Search in the Catalogues and Directories

Page: 1 2 3 4 5 6 7 8 9
Hits 101 – 120 of 168

101
Research in German-English Machine Translation on Syntactic Level. Volume II.
In: DTIC AND NTIS (1970)
BASE
Show details
102
BOUNDS ON THE COMPLEXITY OF GRAMMARS.
In: DTIC AND NTIS (1970)
BASE
Show details
103
SYNTAX DIRECTED TRANSLATION OF CONTEXT FREE LANGUAGES
In: DTIC AND NTIS (1970)
BASE
Show details
104
PROBABILITIES IN CONTEXT-FREE PROGRAMMED GRAMMARS
In: DTIC AND NTIS (1970)
BASE
Show details
105
ON STOCHASTIC CONTEXT-FREE LANGUAGES
In: DTIC AND NTIS (1970)
BASE
Show details
106
Stochastic Automata, Stochastic Languages, and Pattern Recognition
In: DTIC AND NTIS (1970)
BASE
Show details
107
THEORIES OF COMPUTATION.
In: DTIC AND NTIS (1970)
BASE
Show details
108
EXAMPLES OF FORMAL SEMANTICS
In: DTIC AND NTIS (1970)
BASE
Show details
109
PRACTICAL TRANSLATORS FOR LR(k) LANGUAGES.
In: DTIC AND NTIS (1969)
BASE
Show details
110
LINGUISTIC SPECIFICATION AND ANALYSIS OF CLASSES OF LINE PATTERNS.
In: DTIC AND NTIS (1969)
BASE
Show details
111
A SOLUTION OF THE SYNTACTICAL INDUCTION-INFERENCE PROBLEM FOR A NON-TRIVIAL SUBSET OF CONTEXT-FREE LANGUAGE.
In: DTIC AND NTIS (1969)
BASE
Show details
112
NOTE ON FUZZY LANGUAGES.
In: DTIC AND NTIS (1969)
BASE
Show details
113
FULL AFLS AND NESTED ITERATED SUBSTITUTION
In: DTIC AND NTIS (1969)
BASE
Show details
114
A NOTE ON LANGUAGES ACCEPTED BY TIME-BOUNDED NONDETERMINISTIC MACHINES.
In: DTIC AND NTIS (1969)
BASE
Show details
115
A STUDY OF GRAMMATICAL INFERENCE.
In: DTIC AND NTIS (1969)
BASE
Show details
116
ON THE COMPLEXITY OF GRAMMARS.
In: DTIC AND NTIS (1969)
BASE
Show details
117
CHAINS OF FULL AFLS
In: DTIC AND NTIS (1969)
BASE
Show details
118
ON THE CLOSURE OF AFL UNDER REVERSAL
In: DTIC AND NTIS (1969)
BASE
Show details
119
MODELING DETERMINISTIC SYNTAX ANALYZERS BY REDUCTION PROCEDURES
In: DTIC AND NTIS (1968)
Abstract: Bottom-to-top parsers for arbitrary context-free grammars process input strings in exponential time, while parsers for the LR(k) grammars require only linear time. The broad objective of the present investigation is to determine the 'linearizing' features of LR(k) processors so that they can be used in a wider class of parsers. This report describes the results of the first part of this investigation. A model of the LR(k) parsing algorithm is developed in a reduction system which has been previously used to model parsing procedures. By comparing this model to one previously obtained for bottom-to-top parsers, the features of LR(k) grammars and their processors that allow the reduction in parsing time from exponential to linear are exhibited. (Author)
Keyword: (*CONTEXT FREE GRAMMARS; ALGORITHMS; COMPILERS; Linguistics; MATHEMATICAL MODELS); PROGRAMMING LANGUAGES; SET THEORY; SYNTAX
URL: http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=AD0681131
http://www.dtic.mil/docs/citations/AD0681131
BASE
Hide details
120
TREES, TRANSDUCERS, AND TRANSFORMATIONS
In: DTIC AND NTIS (1968)
BASE
Show details

Page: 1 2 3 4 5 6 7 8 9

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
168
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern