The Community for Technology Leaders
RSS Icon
Issue No.01 - January-March (1990 vol.12)
pp: 41-49
<p>The grammar of arithmetic formulas was the pilot example for developing parsing techniques for Chomsky grammars. It is shown how stacks were introduced and how they turned out to be powerful instruments within compilers by controlling state transitions at compile time and storage allocation at run time.</p>
F. L. Bauer, "The Cellar Principle of State Transition and Storage Allocation", IEEE Annals of the History of Computing, vol.12, no. 1, pp. 41-49, January-March 1990, doi:10.1109/MAHC.1990.10004
1. Anonymous. 1961. Kolloquiumüber Sprachen und Algorithmen. Berlin, 8.-11. Juni 1960.Math. Logik, 7, pp. 299-308.
2. Bar-Hillel, Y. and others. 1961. "On formal properties of simple phrase-structure grammars."Z. Phonetik, Sprachwissensch. Kommunik. forsch. 14, pp. 143-172.
3. Bauer, F. L., H. Bottenbruch, H. Rutishauser, K. Samelson, P. Graeff, P. Läuchli, M. Paul, 1958. "Proposal for a Universal Language for the Description of Computing Processes," in J. W. Carr (ed.),Computer Programming and Artificial Intelligence, University of Michigan Summer School 1958, pp. 355- 373.
4. Bauer, F. L. and K. Samelson. 1962. "Maschinelle Verarbeitung von Programmsprachen," in W. Hoffmann (ed.),Digitale Informationswandler, Braunschweig, p. 157.
5. Bauer, F. L. and K. Samelson. 1957. "Verfahren zur Automatischen Verarbeitung von kodierten Daten und Rechenmaschine zur Ausübung des Verfahrens. Nr. B44 122 IX/42m. Auslegeschrift Nr. 1094019 vom 1.12.1960.
6. Bauer, F. L. and Samelson K. 1958. Automatic Computing Machines and Method of Operation. US Patent Nr. 3047228 Filed March 28, 1958. Patented July 31, 1962.
7. Bauer, F. L. 1976. "Historical Remarks on Compiler Construction." in F. L. Bauer and J. Eickel, (eds.),Compiler Construction-An Advanced Course, LNCS 21, Heidelberg: Springer.
8. Boehm, C. 1954. "Calculatrices Digitales."Ann. Pura Appl. Ser., 4, pp. 5-7.
9. Brooker, R. A. and D. Morris. 1962. "A General Translation Program for Phrase-Structure Languages.J. ACM, 9, pp. 1-10.
10. Burks, A. W., D. W. Warren, and J. B. Wright. 1954. "An Analysis of a Logical Machine using Parenthesis-Free Notation."Math. Tables Aids Comp., 8, 53-57.
11. Carr, J. W. III, 1954. "Automatic Programming and its Development on the MIDAC." Office Naval Research Sympos. Washington, D.C.
12. Chomsky, N. 1962. "Context-Free Grammars and pushdown storage." MIT Res. Lap. Rep. 65.
13. Chomsky N. and M. P. Schützenberger. 1963. "The Algebraic Theory of Context-Free Languages," in Computer Programming and Formal Systems, Amsterdam: North Holland.
14. Eickel, J. and Paul, M. 1966. "The parsing and ambiguity problem for Chomsky languages," in Proc. IFIP Working Conf. Formal Language Description Languages (T. B. Steel, ed.) Amsterdam: North Holland.
15. Eickel, J. and others 1963. "A Syntax Controlled Generator of Formal Language Processors."Comm. ACM, 6, pp. 451-455.
16. Eickel, J. 1964. "Generation of Parsing Algorithms for Chomsky-2 Type Languages." Math. Inst. Techn. Univ. Munich Bericht Nr. 6401.
17. Elgot, C. C. 1953. "Single vs. Triple Address Computing Machines." Naval Ordance Report 1741, White Oaks, MD.
18. Ershov, A. P. 1958. "Programmiruyushchaya programma dlya bystrodejstvuyushchej elektronnoj s'chetnoj mashiny." Izdatel'stvo ANVSSSR, Moskva, 116 straniz.
19. Ershov, A. P. 1976. Addendum, in F. L. Bauer and J. Eickel (eds.);Compiler Construction--An Advanced Coursex, LNCS 21, Heidelberg: Springer.
20. Floyd, R. W. 1964. "Bounded Context Syntactic Analysis."Comm. ACM, 7, pp. 62067.
21. Gerneth, D. C. 1948.J. Symb. Logic, 13, pp. 224.
22. Ginsburg, S. 1962.An Introduction to Mathematical Machine Theory. Reading: Addison-Wesley.
23. Ginsburg, S. and H. G. Rice. 1961. "Two Families of Languages related to ALGOL."J. Assoc. Computing Mach, 9, pp. 350-370.
24. Glennie, A. 1960. "On the Syntax Machine and the Construction of a Universal Compiler." Carnegie-Mellon University, Techn. Report No. 2 (AD-240512).
25. Graham, R. M. 1964. "Bounded Context Translation," in Proc. AFIPS 1964 Spring Joint Computer Conference. Spartan, Baltimore, pp. 17-29.
26. Grau, A. A. 1961. "Recursive Processes and ALGOL Translation."Comm. ACM, 4, pp. 10-15.
27. Huskey, H. D. 1951. "Instruction on the Zephir, inProceedings of a Second Symposium on Large-scale Digital Calculating Machinery, Cambridge: Harvard Univ. Press.
28. Huskey, H. D. 1961. "Compiling Techniques for Algebraic Expressions."Computer J., 4, pp. 10-19.
29. Irons, E. T. 1961. A Syntax Directed Compiler for ALGOL 60,Comm. ACM, 4, pp. 51-55.
30. Irons, E. T. 1964. "Structural Connections' in Formal Languages."Comm. ACM, 7, pp. 67-72.
31. Kamynin, S. S., E. Z. Lyubimskij, and M. R. Shura-Bura. 1958. "Ob avtomatizacii programmirovaniya pri pomoshch'yu programmiruyushchesoj programmy." Problemy kibernetiki. Pod redakciej A. A. Lyapunova. Vypusk I. Gosudavstvennoe izdatel'- stovo fiziko-matematicheskoj literatury. Moskva.
32. Kanner, J. 1959. "An Algebraic Translator."Comm. ACM, 2, pp. 19-22.
33. Knuth, D. E. 1973.The Art of Programming, Vol. I, Section 1.4.5 and 2.6,
34. Knuth, D. E. 1965. On the Translation of Languages from Left to Right. Information and Control 8, 607- 639.
35. Lucas, P. 1961. "Die Strukturanalyse von Formelübersetzern."Elektron. Rechenanlagen, 3, pp. 159- 167.
36. Lukasiewicz, J. and A. Tarski. 1930. "Untersuchungenüber den Aussagenkalkül."C. R. Soc. Sci. Lett. Varsovie, Ch. III, 23, pp. 30-50.
37. Menger, K. 1935. Eine elementare Bemerkungüber die Struktur logischer Formeln, in: Menger, K. (ed.),Ergebnisse eines Mathematischen Kolloquiums 3, Leipzig: Deuticke, pp. 22-23.
38. Newell, A. and J. C. Shaw, 1957. "Programming the Logic Theory Machine," inProc. Western Joint Comp. Conf. p. 230.
39. Oettinger, A. G. 1961. "Automatic Syntactic Analysis and the Pushdown Store," inProc. Symposia in Appl. Math. 12: Structure of Languages and its Mathematical Aspects. Am. Math. Soc., pp. 104-124.
40. Paul, M. 1962. "A general processor for certain formal languages," in Symbolic Languages in Data Processing, Proceedings of the ICC Rome Symposium 1962, New York: Gordon&Breach.
41. Paul, M. 1962. "ALGOL 60 processors and a processor generator," in Proc. IFIP Congr. 62, Munich. Amsterdam: North-Holland.
42. Perlis A. J. and others. 1956. "Internal Translator (IT), a Compiler for the IBM 650." Lincoln Lab. Div. 6 D- 327.
43. Rabin, M. O. and D. Scott. 1959. Finite Automata and Their decision problem.IBM J., 3, pp. 115-125.
44. Rosenbloom, P. 1950.The Elements of Mathematical Logic. Dover, New York 1950, p. 205.
45. Rutishauser, H. 1951. "Über automatische Rechenplanfertigung bei programmgesteuerten Rechenmaschinen."Z. Angew. Math. Mech., 31, p. 255.
46. Samelson, K. 1957. "Probleme der Programmierungstechnik. Intern. Kolloquiumüber Probl." Rechentechnik, Dresden, 1955, 61-68, Berlin.
47. Samelson, K. and F. L. Bauer. 1959. "Sequentielle Formelübersetzung."Elektronische Rechenanlagen, 1, pp. 176-182. Also: "Sequential Formula Translation."Comm. ACM, 2, p. 76-83. (1960).
48. Samelson, K. and F. L. Bauer. 1962. "The ALCOR Project." inSymbolic Languages in Data Processing, Proceedings of the ICC Rome Symposium 1962, New York: Gordon&Breach.
49. Schröter, K. 1943. Axiomatisierung der Frege'schen Aussagenkalküle, Forschungen zur Logik und zur Grundlegung der exakten Wissenschaften, N. F. 8. S; alsoJ. Symb. Logic, 9, p. 69.
50. Schützenberger, M. P. 1962. "Certain Elementary Families of Automata." Proc. Symp. Math. Theory of Automata, Brooklyn Polytechnic.
51. Shannon, C. E. 1949. " The Synthesis of Two-Terminal Switching Circuits."Bell System Techn. J., 28, pp. 59-98.
52. Sheridan, P. B. 1959. "The Arithmetic Translator-Compiler of the IBM FORTRAN Automatic Coding System,"Comm. ACM, 2, pp. 9-21.
53. Thue, A. 1910. "Die Lösung eines generellen logischen Problems." Vid.-Sels Skrifter Christiania, Math.-Nat. K. No. 8.
54. Trakhtenbrot, B. A. 1963.Algorithms and Automatic Computing Machines. Boston: Heath.
55. U.S. Patent 1962. Automatic Computing Machines and Method of Operation. NR 3047228, Filed March 28, 1958.
56. Van der Poel, W. L. 1962. Microprogramming and Trickology, in W. Hoffmann (ed.),Digitale Informationswandler, Braunschweig: Vieweg.
57. Vollath, Ulrich. 1988. "Implementierung eines Syntaxanalyseverfahrens für Wortgrammatiken und Erweiterung auf Graphgrammatiken." Masters Thesis, Technical University Munich, November.
58. Wegstein, J. H. 1959. "From Formulas to Computer Oriented Languages."Comm. ACM, 2, pp. 6-8.
59. Zuse, K. 1948. "Über den Plankalkül als Mittel zur Formulierung schematisch-kombinativer Aufgaben."Archiv der Math., 1, pp. 441-449.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool