Parsing Protocols Using Problem Solving Grammars. AI Memo 385 / Mark L. Miller and Ira P. Goldstein.

A theory of the planning and debugging of computer programs is formalized as a context free grammar, which is used to reveal the constituent structure of problem solving episodes by parsing protocols in which programs are written, tested, and debugged. This is illustrated by the detailed analysis of...

Full description

Bibliographic Details
Main Authors: Miller, Mark L.
Goldstein, Ira P. (Author)
Corporate Author: Massachusetts Institute of Technology. Artificial Intelligence Lab
Language:English
Published: [Place of publication not identified] : Distributed by ERIC Clearinghouse, 1976.
Subjects:
Computer Graphics.
Computer Programs.
Context Free Grammar.
Planning.
Problem Solving.
Programing.
Task Analysis.
LOGO System
Reports, Descriptive.
Genre:
Reports, Descriptive.
Physical Description:57 pages
Format: Microfilm Book
Description
Summary:
A theory of the planning and debugging of computer programs is formalized as a context free grammar, which is used to reveal the constituent structure of problem solving episodes by parsing protocols in which programs are written, tested, and debugged. This is illustrated by the detailed analysis of an actual session with a beginning student working on a typical introductory LOGO project. The virtues and limitations of the context-free form of the grammar as a technique for summarizing certain insights into the structure of planning and debugging are discussed, and 17 references are listed. (Author/LLS)
Note:Sponsoring Agency: Advanced Research Projects Agency (DOD), Washington, DC.
Sponsoring Agency: National Science Foundation, Washington, DC.
Contract Number: NSF-EC40708X.
Microform.
Call Number:ED207581 Microfiche
Reproduction Note:
Microfiche. [Washington D.C.]: ERIC Clearinghouse microfiches : positive.