ACM Home Page
Please provide us with feedback. Feedback
Two-level grammars as a technique for formalizing programming schemes
Full text PdfPdf (341 KB)
Source ACM Annual Computer Science Conference archive
Proceedings of the 17th conference on ACM Annual Computer Science Conference table of contents
Louisville, Kentucky
Pages: 305 - 308  
Year of Publication: 1989
ISBN:0-89791-299-3
Authors
M. Saacks  Computer Science Department, Tulane University, New Orleans, LA
J. Hassell  Computer Science Department, Tulane University, New Orleans, LA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 12,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/75427.75466
What is a DOI?

ABSTRACT

This paper addresses the issue of formalizing programming schemes (or programming plans). Research in problem solving and in programming has shown a hierarchical organization of program solutions. This organization suggests that a hierarchical formal definition can be used to eliminate the ambiguity inherent in previous natural language definitions. This paper uses the hierarchy implicit in two-level grammars to define programming schemes. It gives examples to illustrate how the definition can be used for a particular scheme.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
ADE81
B. Adelson, Problem Solving and the Development of Abstract Categories in Programming Languages, Memory and Cognition, 9(1981), 422-433.
 
CHA73
W. C. Chase and H. Simon, Perception in Chess, Cognitive Psychology, 4(1973) 55-81.
 
DEG65
A. D. deGroot, Thought and Choice in Chess, Paris, France, Mouton, 1965.
 
DEG84
J. De Graaf and A. Ollongran, On Two-Level Grammars, International Journal of Computer Mathematics, 15(1984), 269-288.
 
GEN83
D. Gentner and D. Gentner, Flowing Waters or Teeming Crowds: Mental Models of Electricity, In Mental Models, D Genmer (ed), 1983.
 
GIC86
M. Gick, Problem-Solving Strategies, Educational Psychology, 21(1986), 99-120.
 
GIC83
M. Gick and K. Holyoak, Schema Induction and Analogical Transfer, Cognitive Psychology, 15(1983)1-38.
 
HAR78
 
HOR84
 
HOR84
 
KEA85
M. Keane, On Drawing Analogies A Theory and Test of Solution Problem-Solving Task, British 76(1985)449-458.
 
KNU73
D. Knuth, The Art of Computer Sorting and Searching, Company, 1973.
 
LEV83
J. Levy, The Einstellung Effect Honors Thesis, Tulane University, 1983,
 
MAL84
J. Maluszynski, Towards a Programming the Notion of Two-Level Grammar, Science, 28(1984), 13-43.
 
MAR77
M. Marcotty, H. Ledgard, Formal Definitions, Computing 191-276.
 
MAY81
R. Mayer, The Psychology of Programming, Computing Surveys,
 
NUT85
J.T. Nutter and J. Hassell, Program Understanding and Association for Educational 18(1985), 195-206.
 
POH86
H.L. Pohl and J.T. Nutter, Language Acquisition, Association Systems Journal, 18(1985),
 
RIS86
R.S. Rist, Plans in Programming: and Development, In Empirical E. Soloway and S. Iyengar (eds) 1986.
 
SCH77
R.C. Schank and R. Abelson, Understanding, Lawrence Erlbaum
 
SIM78
D.P. Simon and H.A. Simon, Solving Physics Problems, In develops?, R.S. Siegler (ed)
 
SOL81
E. Soloway and B. Woolf, Problems, ACM SlGCSE Bulletin, 12
 
SOL82
E. Soloway, K. Ehrlich, J. Bonar, Novices Know About Programming, Computer-Human Interaction, Badre (eds) Ablex Publishing
 
SOL83
E. Soloway, K. Ehrlich, and Like Reading a Story (well, almost) Fifth Annual Conference Society, 1983.
 
SOL84
E. Soloway and K. Ehrlich, Programming Knowledge, IEEE Engineering, 10(1984) 595-609.
 
TRE76
J.P. Tremblay and P.G. Sorenson, Structures with Applications,
 
VAN75


Peer to Peer - Readers of this Article have also read: