DE eng

Search in the Catalogues and Directories

Page: 1...60 61 62 63 64
Hits 1.261 – 1.270 of 1.270

1261
FINITE-TURN PUSHDOWN AUTOMATA.
In: DTIC AND NTIS (1965)
BASE
Show details
1262
WORD CONCEPTS: A THEORY AND SIMULATION OF SOME BASIC SEMANTIC CAPABILITIES
In: DTIC AND NTIS (1965)
BASE
Show details
1263
(NO TITLE).
In: DTIC AND NTIS (1964)
BASE
Show details
1264
MILITRAN REFERENCE MANUAL
In: DTIC AND NTIS (1964)
BASE
Show details
1265
MILITRAN OPERATIONS MANUAL FOR IBM 7090-7094
In: DTIC AND NTIS (1964)
BASE
Show details
1266
FORSIM 4. FORTRAN 4 SIMULATION LANGUAGE USER'S GUIDE
In: DTIC AND NTIS (1964)
BASE
Show details
1267
AN ALGORITHMIC THEORY OF LANGUAGE
In: DTIC AND NTIS (1962)
BASE
Show details
1268
DETECTION OF GENERATIVE AMBIGUITIES IN CONTEXT-FREE MECHANICAL LANGUAGES.
In: DTIC AND NTIS (1962)
Abstract: The author considers the problem of detecting those words in a 'context-free' mechanical language which can be derived from the defining 'productions' in essentially more than one way. The problem of finding a single algorithm accepting the generative specifications of such languages, and determining in a finite time whether or not such 'ambiguities' exist, is known to be unsolvable. The author, however, by defining the 'generative levels' with respect to the production system for each word of the language, specifies a processor called a 'limited ambiguity detector' whose main component is a 'derivation generator'; the latter works with a mixed language including the object language and a portion of the syntax language belonging to the class of generalized prefix languages as recently defined by the author. Such a detector would be supplied by the user with a value of a natural number parameter n, and would find all ambiguities through level n, with print-outs which might read: 'level 375 is finished and all is well', or 'level 379 is finished, and the following words are ambiguous with the following derivations at levels less than or equal to 379'. This detector is a fairly efficient four-tape processor. The fact that it can be designed is useful information to 'standardizers' who want to certify, for unambiguity up to level n, specified context-free languages, such as the syntactic part of ALGOL. (Author) ; Prepared for presentation at IFIP Congress 62 Munich, Germany, Session 39 - Symposium on Languages for Processor Construction August 27-September 1, 1962.
Keyword: (*CONTEXT FREE GRAMMARS; ALGORITHMS; Computer Hardware; Computer Programming and Software; DATA PROCESSING; FLOW CHARTING; INPUT OUTPUT DEVICES; Linguistics; MAGNETIC TAPE; PROGRAMMING LANGUAGES); SEMANTICS; SYNTAX
URL: http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=AD0636319
http://www.dtic.mil/docs/citations/AD0636319
BASE
Hide details
1269
Teaching Machines and Their Applications. Supplement
In: DTIC AND NTIS (1961)
BASE
Show details
1270
A MANUAL FOR AUTOMATIC DICTIONARY REVISION.
In: DTIC AND NTIS (1960)
BASE
Show details

Page: 1...60 61 62 63 64

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
1.270
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern