Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6260
Full metadata record
DC FieldValueLanguage
dc.creatorMiller, Mark L.-
dc.creatorGoldstein, Ira P.-
dc.date2004-10-04T14:47:35Z-
dc.date2004-10-04T14:47:35Z-
dc.date1976-12-01-
dc.date.accessioned2013-10-09T02:44:32Z-
dc.date.available2013-10-09T02:44:32Z-
dc.date.issued2013-10-09-
dc.identifierAIM-385-
dc.identifierhttp://hdl.handle.net/1721.1/6260-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionA 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.-
dc.format13934558 bytes-
dc.format9681939 bytes-
dc.formatapplication/postscript-
dc.formatapplication/pdf-
dc.languageen_US-
dc.relationAIM-385-
dc.titleParsing Protocols Using Problem Solving Grammars-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.