| { |
| "paper_id": "C67-1010", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T12:35:43.539037Z" |
| }, |
| "title": "", |
| "authors": [ |
| { |
| "first": "Steven", |
| "middle": [ |
| "I" |
| ], |
| "last": "Laszlo", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Western Union Telegraph Co", |
| "location": {} |
| }, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "The framework is machine-translation. Compiler-building can for'a variety of reasons be considered as a special case of machine-translation. It is the purpose of this paper to explicate some techniques used in compiler-building, and to relate these to linguistic theory and to the practice of machine-translation. \" The generally observed machine-translation procedure could be schernatized as in FIGURE 1, or to put it another way, le 2. 3. Parsing the source-text. Translation from source to object-language. Synthesis of gramrrmtically correct object-text.", |
| "pdf_parse": { |
| "paper_id": "C67-1010", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "The framework is machine-translation. Compiler-building can for'a variety of reasons be considered as a special case of machine-translation. It is the purpose of this paper to explicate some techniques used in compiler-building, and to relate these to linguistic theory and to the practice of machine-translation. \" The generally observed machine-translation procedure could be schernatized as in FIGURE 1, or to put it another way, le 2. 3. Parsing the source-text. Translation from source to object-language. Synthesis of gramrrmtically correct object-text.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "The translation usually occurs on the level of some simplified, cannonical form (that is not necessarily the kernel-form) of both languages, such that the source-text is decomposed, and the object-text recomposed from this form.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "The translation algorithm usually requires a statement of the structure of both the source and the object-language, a.s well as the statemen~f some primitive-to-primitive correspondence paradigm for both syntactic and lexical primitives. Compilers on the other hand work on the bases of only the first two steps of FIGURE 1. : breakdown, . and translation. Consequently, the processor requires only statements of the structure of the source -language and of the correspondence paradigm.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "That does not imply that the structure of the object-language is irrelevantto the process of translation, but that it is implicit in the correspondence paradigm, and in the selection of what is a primitive or terminal in the description of the Source~-language.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "Through the use of examples it will be shown that BNF and similar language-description devices (8) are --by themseives -both analytically and generatively inadequate and depend on other devices, implicit in the translation algorithm.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "It will be shown that by some extensions of the notion of P-rules and some applications of the concept of T-r___.~e__.s (4), a description that is bpth analytically and generatively adequate may be constructed for programming languages.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "The programming language P. O. L. Z (IZ}, (13) was selected for the examples because an adequate, fully explicit description does exist for it; furthermore, the language contains most syntactically problernatic features of other programming languages as well as presenting a few unique problems in description that are worthy of attention.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "\u2022 The failure to come to grips with the ~ problem is sufficient to demonstrate the inadequacy of BNF and similar devices \u2022 (8). The simplified program-segments in FIGURE 2, serve to illustrate EXAMPLE I. I. Let A be variable.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "Let B be = \"7\". 3.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "2.", |
| "sec_num": null |
| }, |
| { |
| "text": "Let C be = \"9.5 'i.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "2.", |
| "sec_num": null |
| }, |
| { |
| "text": "Let D be = \". 07Z\". 5. A=B+C/D. 6. Print A.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "4.", |
| "sec_num": null |
| }, |
| { |
| "text": "Define Funct (A, B) = (C). this problem. B'NF and similar devices would generate a parse designating \"A, \"B\", etc. in qEXAMPLE 1. as identifier (a syntactic word-class) hut would fail to indicate that the various occurrences of a given identifier (e. g., \"A\" in statements 1., 5., and 6. ) are that of the same lexical token or semantic object. Related to the identity problem is the restriction that each identifier occurring in a program statement must also occur in one and only one definition. This restriction may be called the definitionproblem.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "EXAMPLE Z.", |
| "sec_num": null |
| }, |
| { |
| "text": "BNF, etc., do not handle the definition problem. Other manifestations of the identity and definition problems are associated with the use of macro-or compound functions (see EXAMPLE Z., FIGURE Z.), subscript expressions, etc.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "EXAMPLE Z.", |
| "sec_num": null |
| }, |
| { |
| "text": "Since there exists a demonstrable necessity for establishing the above mentioned identities and restriction (3), compilers contain --implicit in the translation algorithm --an elaborate The above reasons for positing a transformational component are in essence the programming-language equivalents of Chomskyls original reasons to use transformations in the description of natural languages.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "EXAMPLE Z.", |
| "sec_num": null |
| }, |
| { |
| "text": "Rule 1. M 9-#,M,se1.1, #", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "EXAMPLE Z.", |
| "sec_num": null |
| }, |
| { |
| "text": "where '!M\"is the initial symbol, \"#\" is the boundary marker, and the subscript will be explained later. In FIGURE 3., in a simplified form it is shown that the phrasestructure component generates function definitions (17), (18) embedded in others (see Rule 3. ), and that the form of the function is generated in the definition --as the expansion of the symbol \"functmention\" --generating place-holders for instances of use of the function. Transformations replace the place-holders with the appropriate form of the function generated in the definition, thus accounting for both the identity and the definition problems. Other transformations exist to handle other instances of these problems e. g., labels, identifiers, subscript expressions.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "EXAMPLE Z.", |
| "sec_num": null |
| }, |
| { |
| "text": "The method is : identical: the form is generated in the relevant definition, placeholders are generated for instances of use, and the place-holders are replaced transformationally with the correct form generated in the definition.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "EXAMPLE Z.", |
| "sec_num": null |
| }, |
| { |
| "text": "Other transformations deal with additional notational ! restrictions of P. O. L.Z. One such restriction is that a function definition may reference other functions but a definition may not be embedded in another. Definitions (see FIGURE 3. ) are in fact generated embedded, and it becomes necessary to posit some exbedding tra.nsformation 7, moving the nested definitions outside the \"parent\" definition. There exist several proofs in the literature establishing the equivalence between languages generated by grammars with and without the use of boundary markers (5), (10). The exbedding transformation may be expressed more simply if boundarymarkers are used (see ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "EXAMPLE Z.", |
| "sec_num": null |
| }, |
| { |
| "text": "The boundary-markers may be deleted later by another transformation, or they may rewrite as carriage-returns on some keyboard, depending on the orthography of the particular implementation and medium.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "The T-rules may be generated by positing a set of elementary transformations (i. e. , single node operations ) and a set of formation and ~ombination rules over the set of elementary transformations, prJoducing some set of compound or complex transformations.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "This i~ not significantly different from having locally ordered subsets of a set of elementary transformations (11), (1Z)\u00b0 Syntactic descriptions of programming languages published in the past =-e. g., (1), (9), (19) --generally Cook a programstatement to correspond to the basic unit of :'grammar, denoted by the. initial symbol of the phrase-structure grammar.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "The grammer discussed here takes a function definition (s~e FIGURE 3. ) as its basic unit. Program-statements are elements of the intermediate alphabet and have no other theoretical standing or significance. The natural language correlates of program-statements are sentences, and function definitions correspond to some largerthan-sentence units of discourse (e. g., paragraphs or chapters). This procedure may lead to some syntactic or at least linguistic method of distinguishing between \"meaningful\" and \"meaningless\" . programs.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "Using a syntax of prograins, orfunctlons also yields an intuitively more pleasing set of relationships among elements ~f the described language.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "The present grammar makes no effort to distinguish between' \"elegant\" and inelegant\" programming, but does distinguish both from \"ungrammatical\" Code. Declaring arguments or variables never \u2022referenced is inelegant; referencing undeclared operands is ungrammatical.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "To return momentarily to the identity and definition problems: it is possible to generate a definition such that there are no corresponding place-holders; but each place-holder must be replaced by some definition-generated form of the appropriate nature. In describing the definition and use of functions, separate place-h01ders accomodate recursive use and the general case of usage.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "It is customary to give descriptions of programming languages such that --with the exception of some small set of key words such as arithmetic operators, delimiters of definitions, etc. --the phrase-structure grammar generates character-strings for the !exical items. In naturai languages the vocabulary is fixed. There is a stable, limited Set of vocabulary elements that correspond to each syntactic word-class.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "In programming languages that is not the case: a small set of word-classes rewrite each as a set of one or more key-words; others will expand --through the use of some phras&-structure rules --as any string\u2022 of characters.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "In the descriptian of P. O. L. Z it was decided to separate the lexicon= generation rules from the phrase-structure rules.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "Though they are the same shape that BNF rules of the same purpose .would be, it was de~erm~ned that separating the rules generating lexical items -even as morphophonemic rules of natural languages represent a separate class of rules --is more intuitively acceptable: a class of orthographic rules. FIGURE 5. indicates what some of these rules ~night look like.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "In the tekt 0g FIGURE 3., Rule 1., the explanation of the subscript was deferred. Functions and operators used in programming languages\u2022are two notational variants of the same concept (17). Depending onthe notation of the system, any operation may be expressed either as an operator or a function. Since in ]Being defined as one or the other, however, restricts their distribution or \"embeddability\" to certain contexts. This phenomenon is accounted for by the use of a device similar to the notation of complex s_ymboltheory (4), (11), (lZ), (15). The P.O.L. Z notation is such that functions (i. e., defined macro s) ma 7 occur as functions, coordinate transformations (linear or otherwise) or as operands (denoting their value for a particular \u2022 set of arguments) and operators may appear as arithmetic, relational or logical operators, depending on range and/or domain as well as distributional restrictions.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "In P. O. L. 2 every program however simple or complex --must have an \"outermost\" function, one into which all others are embedded by the P-rules.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "The first rule of the grammar (see FIGURE 5., Rule 1. ) expands the \"outermost\" function. Elsewhere in the phrase-structure component, depending on context, other \"Msel. i s'' are introduced, as well as ~'Mse!. Zs\", \"Msel. 3 s'', \"M and \"M ~s\".", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "sel. 4 s\", sel.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "Th~ese correspond to the various embedded occurrences of functions and Operators. The rewrites or expansions of the several versions of \"M\" are almost identical except for the string denoting the left bracket delimiting the definition. Alternative solutions exist but the above one appears most intuitively satisfying. There are proofs and demonstrations in the literature to the effect that full, left, or right parenthesis notation is context-free, but not much on elided parenthesis notation. We have in the past constructed several context-sensitive grammars generating elided parenthesis notation, but they did not seem very satisfactory. Adding a device not heretofore associated with production-rules, a i set of rules was produced to generate the elided parentheses notation such that the rules look and process very much like contextfree rules (see FIGURE 6.).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": ".~ Rule I. Though the \"counter\" n and the \"increment \" eare not part of a known system of production rules, their nature and the reason for their use can be clearly stated. Their use per,nits a simpler scanner for the syntax than context-restricted rules do. A similar counter is used to handle the concatenations of ntuples.. In P. O. L. Z an item of data may be declared as a pair, triple, or n-tuple, and operations may be performed over nltuples of identical n.s (see FIGURE 7. ).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "Rule i. n-tuple-expression \")\" n-tuple, operator, n-tuple wlrere n = n = n. Any of the n-tuples may however be concatenates of two or more n-tuples of smaller n-s such that: Of course, the (m)-tuple or the (n-m)-tuple may be further broken down by the same rule into further concatenates.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "The above are selected examples rather than an exhaustive list of the transformations in the syntax of P. O. L.Z. A rigorous statement of the transformations is available, stated as mappings Of structural descriptions into structural descriptions, accounting for the attachment and detachment of nodes. Presenting the selection of transformations here in a descriptive rather than a rigorous form offers an idea of the general approach.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "Constructing the phrase structure component, many alternative solutions or approaches came up at every juncture; in specifying the transformational component, the alternatives quickly multiplied beyond manageable proportions. It is certainly the case that throughout its brief but exciting history, one of the aims of transformational theory has been to describe language in terms of the most\u2022 restricted --hence simplest--system possible. But one may well regard the sets of devices solar advanced as parts of transformational theory, as algorithmic alphabets (in the A.A. Markov/M~rtin Davis (5), (15) sense). Specific algorithmic alphabets are more or less arbitrary selections from some universe of elementary and compound algorithms bound by formation and com~ination rules. This paper is not a proposal toward the modification, extension or restriction of transformational theory, merely at, indication that an overlapping set of algorithms may be selected to deal with a similar but not identical problem: the structural ~ \" \" descrlptlon of some formal notation systems such as programming languages.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "Beyond doubt, substantial simplification and sophistication may be achieved over the model described here.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| }, |
| { |
| "text": "The effort here has been toward the application of linguistic techniques to artificial languages, conforming to the linguist's notion of what it means to \"give an account 0f the data\", rather than to the laxer standards of themethods used to describe programming languages.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "FIGURE 4o", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "The Syntax and Semantics of the", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [ |
| "W" |
| ], |
| "last": "Ba~kus", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "Information Processing; Proceedings of the International Conference on Information Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ba~kus, J.W. \"The Syntax and Semantics of the. Proposed International Algebraic Language of the Zurich ACM-GAMM Conference\", Information Processing; Proceedings of the International Conference on Information Processing. Paris:", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "The Introduction of Definitional Facilities", |
| "authors": [ |
| { |
| "first": "Jr", |
| "middle": [], |
| "last": "Cheatham", |
| "suffix": "" |
| }, |
| { |
| "first": "T", |
| "middle": [ |
| "E" |
| ], |
| "last": "", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Cheatham, Jr., T.E. The Introduction of Definitional Facilities..", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "The Theory and Construction O f Compilers Draft Report CA-6606-0111", |
| "authors": [ |
| { |
| "first": "Mass", |
| "middle": [], |
| "last": "Wakefield", |
| "suffix": "" |
| } |
| ], |
| "year": 1966, |
| "venue": "into Higher Level Programming Languages", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "into Higher Level Programming Languages. Draft Report i CA-6605-061 I. ; Wakefield, Mass. : Computer Associates, Inc., 1966. The Theory and Construction O f Compilers Draft Report CA-6606-0111. ; Wakefield, Mass. : Computer~ Associates, Inc., 1966'.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Aspects of the Theory of Syntax. Cambrtdge~", |
| "authors": [ |
| { |
| "first": "Noam", |
| "middle": [ |
| ". ." |
| ], |
| "last": "Chomsky", |
| "suffix": "" |
| } |
| ], |
| "year": 1965, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Chomsky, Noam. .... Aspects of the Theory of Syntax. Cambrtdge~ \" , Mass.:'MIT Press, 1965. \"On Certain Formal Properties of", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "Grammars", |
| "authors": [], |
| "year": 1959, |
| "venue": "Information and Control", |
| "volume": "2", |
| "issue": "", |
| "pages": "137--167", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Grammars\", Information and Control, 2, (1959), pp. 137-167.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "The Position of Embedding Transformations in a Grammar", |
| "authors": [ |
| { |
| "first": "Re", |
| "middle": [ |
| "C J" |
| ], |
| "last": "Film", |
| "suffix": "" |
| } |
| ], |
| "year": 1963, |
| "venue": "", |
| "volume": "19", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Film,re. C.J. \"The Position of Embedding Transformations in a Grammar\",.Word,19, Z, (1963).", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "Specification Languages for Mechanical Languages and their Processors --A Baker's Dozen", |
| "authors": [ |
| { |
| "first": "Saul", |
| "middle": [ |
| "\u2022" |
| ], |
| "last": "Corn", |
| "suffix": "" |
| } |
| ], |
| "year": 1961, |
| "venue": "Communications of the ACM", |
| "volume": "7", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Corn, Saul\u2022 \"Specification Languages for Mechanical Languages and their Processors --A Baker's Dozen\", Communications of the ACM, 7, 12, (1961).", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "TIistory and Summary of FORTRAN Standardization Development for the ASA", |
| "authors": [ |
| { |
| "first": "W", |
| "middle": [ |
| "P" |
| ], |
| "last": "Heising", |
| "suffix": "" |
| } |
| ], |
| "year": 1964, |
| "venue": "Communications of the ACM", |
| "volume": "7", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Heising, W.P. 'TIistory and Summary of FORTRAN Standardi- zation Development for the ASA\", Communications of the ACM, 7, ~0, (1964).", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "Three Theorems on Phrase Structure Grammars of Type I", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [ |
| "S" |
| ], |
| "last": "Landweber", |
| "suffix": "" |
| } |
| ], |
| "year": 1963, |
| "venue": "Information and Control", |
| "volume": "6", |
| "issue": "", |
| "pages": "131--136", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Landweber, P.S. \"Three Theorems on Phrase Structure Grammars of Type I\", Information and Control, 6, (1963), pp. 131-136.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Cycles and Complex Symbols in English Syntax. Unpublished Manuscript, Indiana UniversitY, ]963. Some Constraints On Transformations. Unpublished manuscript", |
| "authors": [ |
| { |
| "first": "G", |
| "middle": [ |
| "P" |
| ], |
| "last": "Lakoff", |
| "suffix": "" |
| } |
| ], |
| "year": 1964, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Lakoff, G.P. Cycles and Complex Symbols in English Syntax. Unpublished Manuscript, Indiana UniversitY, ]963. Some Constraints On Transformations. Unpublished manuscript, Indiana Universify, 1964.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "Report on a Proposed General Purpose Procedure Oriented Computer Programming Language\"\u2022 Repo.rt of the Institute of Educational Research", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [ |
| "I. ; P O L" |
| ], |
| "last": "Laszlo", |
| "suffix": "" |
| } |
| ], |
| "year": 1965, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Laszlo, S.I. \"Report on a Proposed General Purpose Procedure Oriented Computer Programming Language\"\u2022 Repo.rt of the Institute of Educational Research, Bloomington: Indiama \u2022 University, 1965. \"P.O.L., A General Purpose, Procedure Oriented Computer Programming Language\" Repor t of the Institute Of Educational Research, Bloomington: Indianan University, 1965.", |
| "links": null |
| }, |
| "BIBREF14": { |
| "ref_id": "b14", |
| "title": "Problems of Selection in Transformational Grammar", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [ |
| "H" |
| ], |
| "last": "Matthews", |
| "suffix": "" |
| } |
| ], |
| "year": 1965, |
| "venue": "Journal of L.!nguistics, i", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Matthews, P.H., \"Problems of Selection in Transformational Grammar\", Journal of L.!nguistics, i, (1965)\u2022", |
| "links": null |
| }, |
| "BIBREF15": { |
| "ref_id": "b15", |
| "title": "Theory of Algorithms", |
| "authors": [ |
| { |
| "first": "V", |
| "middle": [], |
| "last": "Mark", |
| "suffix": "" |
| }, |
| { |
| "first": "A", |
| "middle": [ |
| "A" |
| ], |
| "last": "", |
| "suffix": "" |
| } |
| ], |
| "year": 1965, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Mark,v, A.A., Theory of Algorithms. Washington, D.C. : U.S. Printing Office, 1965.", |
| "links": null |
| }, |
| "BIBREF16": { |
| "ref_id": "b16", |
| "title": "A Basis for a Mathematical Theory of Computation", |
| "authors": [ |
| { |
| "first": "John", |
| "middle": [], |
| "last": "Mccarthy", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "Computer Programming and Formal Systems", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "McCarthy, John \"A Basis for a Mathematical Theory of Computation\", in Computer Programming and Formal Systems.", |
| "links": null |
| }, |
| "BIBREF17": { |
| "ref_id": "b17", |
| "title": "Amsterdam: N. Holland \"9-Publishing Co. 1963", |
| "authors": [], |
| "year": null, |
| "venue": "", |
| "volume": "18", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "P. Braff0rt & D. Hirschberg (ed.), Amsterdam: N. Holland \"9- Publishing Co. 1963. . 18. et al., LISP 1.5 Programmer's Manual;", |
| "links": null |
| }, |
| "BIBREF19": { |
| "ref_id": "b19", |
| "title": "Revised Report on the Algorithmic Language ALGOL 60", |
| "authors": [], |
| "year": 1964, |
| "venue": "Communications of the ACM", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Naur, Peter (ed.) \"Revised Report on the Algorithmic Language ALGOL 60\", Communications of the ACM, reprinted in \u2022 E.W. Dijkstra, A Primer of ALGOL Programming. New York: Academic Press, 1964.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "num": null, |
| "type_str": "figure", |
| "text": ", translation, and recomposition.", |
| "uris": null |
| }, |
| "FIGREF2": { |
| "num": null, |
| "type_str": "figure", |
| "text": "FIGURE Z.", |
| "uris": null |
| }, |
| "FIGREF3": { |
| "num": null, |
| "type_str": "figure", |
| "text": "Rule Z. M -~DEFINE, functmention, program, END sel. I where the convention is used that terminal symbols are all capital letters, and members of the intermediate alphabet are in lower case.", |
| "uris": null |
| }, |
| "FIGREF4": { |
| "num": null, |
| "type_str": "figure", |
| "text": "FIGURE 3.", |
| "uris": null |
| }, |
| "FIGREF5": { |
| "num": null, |
| "type_str": "figure", |
| "text": "FIGURE 4. ). #, ..., #, M, #, ..., #.> #, M, #, #, ..., # or M", |
| "uris": null |
| }, |
| "FIGREF6": { |
| "num": null, |
| "type_str": "figure", |
| "text": "...~\" enclose alternative options such that one and only onetoftHeJ options enumerated must~be selected. . L. Z there are both functions and operators, depending on notational convenience, newly defined operations may be defined as either.", |
| "uris": null |
| }, |
| "FIGREF7": { |
| "num": null, |
| "type_str": "figure", |
| "text": "cycle (II)n remains the same integer between s ubrules I and 2 and e remains the same integer increment.", |
| "uris": null |
| }, |
| "FIGREF8": { |
| "num": null, |
| "type_str": "figure", |
| "text": "FIGURE 6.", |
| "uris": null |
| }, |
| "FIGREF9": { |
| "num": null, |
| "type_str": "figure", |
| "text": "Rule Z. n-tuple ~ (m) -tuple, concatenator, (n-m____)-tupl e where n andre are positive integers and the arithmetic relationship designated obtains.", |
| "uris": null |
| }, |
| "FIGREF10": { |
| "num": null, |
| "type_str": "figure", |
| "text": "FIGURE 7.", |
| "uris": null |
| } |
| } |
| } |
| } |
