摘要: Certainly one of the most characteristic principles to organize computations with help appropriate data structures is so-called stack principle. It used not only when expressions parentheses are be evaluated, but even more importantly it also essential principle organizing inside memory calling nested procedures. The works for locally declared within scopes and therefore prominent implementation idea dealing high-level languages, block such as languages ALGOL family. paper describes early ideas on using stacks starting from evaluating development processes that have led language
springer.com
sci-hub.se 参考文章(29)
Friedrich Ludwig Bauer, Klaus Samelson, Verfahren zur automatischen Verarbeitung von kodierten Daten und Rechenmaschine zur Ausübung des Verfahrens Springer, Berlin, Heidelberg. pp. 29- 40 ,(2001) , 10.1007/978-3-642-48354-7_2
P. LUCAS, Die Strukturanalyse von Formelübersetzern / Analysis of the structure of formula translators Information Technology. ,vol. 3, pp. 159- 167 ,(1961) , 10.1524/ITIT.1961.3.16.159
Peter Deussen, Bericht über ein Programm zur Übersetzung Boolescher Ausdrücke in disjunktive Normalform 2. Colloquium Über Schaltkreis- und Schaltwerk-Theorie. pp. 66- 81 ,(1963) , 10.1007/978-3-0348-4156-6_3
John W. Backus, The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM Conference. ifip congress. pp. 125- 131 ,(1959)
Paul Bernays, Karl Schröter. Axiomatisierung der Fregeschen Aussagenkalküle. Forschungen zur Logik und zur Grundlegung der exakten Wissenschaften, new series, no. 8. Leipzig1943, 26 pp. Journal of Symbolic Logic. ,vol. 9, pp. 69- 69 ,(1944) , 10.2307/2267888
Walter Petry, Übersetzung formaler Sprachen in topologische Strukturen Zentralbibliothek der Kernforschungsanlage Jülich. ,(1964)
Karl Sigmund, Karl Menger, John W. Dawson, Egbert Dierker, Ergebnisse eines Mathematischen Kolloquiums Franz Deuticke. ,(1998)
Konrad Zuse, Über den Allgemeinen Plankalkül als Mittel zur Formulierung schematisch-kombinativer Aufgaben Archiv der Mathematik. ,vol. 1, pp. 441- 449 ,(1948) , 10.1007/BF02038459
Dal Charles Gerneth, Generalization of Menger's result on the structure of logical formulas Bulletin of the American Mathematical Society. ,vol. 54, pp. 803- 804 ,(1948) , 10.1090/S0002-9904-1948-09083-8
F. L. Bauer, The formula-controlled logical computer “Stanislaus” Mathematics of Computation. ,vol. 14, pp. 64- 67 ,(1960) , 10.1090/S0025-5718-1960-0135685-3