Parsing Protocols Using Problem Solving Grammars
| dc.contributor.author | Miller, Mark L. | en_US |
| dc.contributor.author | Goldstein, Ira P. | en_US |
| dc.date.accessioned | 2004-10-04T14:47:35Z | |
| dc.date.available | 2004-10-04T14:47:35Z | |
| dc.date.issued | 1976-12-01 | en_US |
| dc.identifier.other | AIM-385 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6260 | |
| dc.description.abstract | A theory of the planning and debugging of programs is formalized as is context free grammar. The grammar 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. The virtues and limitations of the context free formalism are considered. | en_US |
| dc.format.extent | 13934558 bytes | |
| dc.format.extent | 9681939 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | AIM-385 | en_US |
| dc.title | Parsing Protocols Using Problem Solving Grammars | en_US |
