ASSISTments is an online adaptive tutoring system with the ability to provide assistance to students in the form of hints and scaffolding. ASSISTments has many features to help students improve their knowledge. Researchers run studies in order to discover ways for students to learn better but ASSISTments is missing one major aspect for researchers: student level personalization. It is easy to create an assignment for a particular class or school but it would take much longer to create an assignment for each student and it would be difficult for the teacher to look through many assignment reports. One of the strongest code blocks in coding is the if-then; allowing the program to branch off to another set of code under certain circumstances. ASSISTments needed an if-then system in order for students to branch off to other parts of the assignment under certain circumstances. With this, researchers would be able to personalize assignments to give more help to lower knowledge students or allow students to get a choice of what kind of tutoring they would like to receive. With this idea in mind, the basic if-then structure was implemented into ASSISTments using problem or problem set correctness as the condition statement. Once the if-then system was created opportunities opened to create additional experiments and run studies in ASSISTments. The basic if-then was limited in using correctness only for its condition statement. This meant that a new if-then system would need to be implemented to include custom condition statements that allowed the researcher to have the assignment branch on any condition using all the information recorded in the assignment. While work was being done on the if-then system, research was being done and two papers were written on partial credit in ASSISTments. Partial credit was found out to be as accurate as knowledge tracing in determining student performance on the next problem. Once a partial credit algorithm was found, a study using if-then was analyzed. It was found that there was no statistically significant difference between students who were given a choice on their feedback and students who received no choice.

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Operatorless Prolog text is LL(1) in nature and any standard LL parser generator tool can be used to parse it. However, the Prolog text that conforms to the ISO Prolog standard allows the definition of dynamic operators. Since Prolog operators can be defined at run-time, operator symbols are not present in the grammar rules of the language. Unless the parser generator allows for some flexibility in the specification of the grammar rules, it is very difficult to generate a parser for such text. In this thesis we discuss the existing parsing methods and their modified versions to parse languages with dynamic operator capabilities. Implementation details of a parser using Javacc as a parser generator tool to parse standard Prolog text is provided. The output of the parser is an “Abstract Syntax Tree” that reflects the correct precedence and associativity rules among the various operators (static and dynamic) of the language. Empirical results are provided that show that a Prolog parser that is generated by the parser generator like Javacc is comparable in efficiency to a hand-coded parser.

This thesis concerns itself with the problems of manipulation with Cascading Style Sheets. The first aim is to create a library for manipulation with Cascading Style Sheets - an object interface of Cascading Style Sheet is proposed, a parser is generated by means of an appliance of JavaCC, the implementation of interface is completed and as a whole connected to a functional unit. The library enables reading Cascading Style Sheet and its transfer into an object representation, editing and subsequently exporting back to the text file. The second part of the thesis deals with the implementation of library for assign property values - every (X)HTML document is formed by the tree of elements to which the rules are consequently searched for in CSS and their declarations are asigned in the correct order. In conclusion of the thesis the DEMO application, which illustrates the possibilities of both libraries and facilitates performing of experiments or testing, is described. Hereafter the technique of profiling, which enables to find out the efficiently demanding passages, which can be optimised further, in the source code, is shown.

圖形化模型編輯器是模型編輯器開發長久以來一直努力的方向。Eclipse.org 已提供兩個功能強大的圖形化編輯器設計框架：GEF 圖形化編輯器設計框架，和將 EMF 與 GEF 結合並簡化其設計流程的 GMF 圖形化模型編輯器設計框架，來協助開發者發展圖形化模型編輯器。 / 使用設計框架時所面臨的高學習門檻是開發者選用設計框架上的一大障礙。為降低開發者在 GMF 使用上的學習門檻，我們希望能提供一個以模型開發為導向的圖形編輯器設計專屬模型語言，讓程式設計師能夠以其慣用的程式設計角度來描述其圖形化模型編輯器的組成架構。 / 本篇研究主要是在探討 GMF 圖形化模型編輯器開發流程的簡化。在研究中希望藉由提供 GMF 圖形化模型編輯器設計框架的 GM3 專屬模型語言，讓開發者能夠透過 MDA 的角度來開發圖形化模型編輯器的架構，藉以縮短 GMF 的開發流程。實驗中使用 JavaCC 文法剖析器產生工具來開發 GM3專屬模型語言與 GMF 各項模型定義間的模型轉換。 / The availability of a visual graphical editor for a target domain is the prerequisite of visual graphical modeling, which has been adopted by classical software development for decades and is especially emphasized in today's model-driven engineering. However, compared with traditional textual editors, developing a visual graphical editor from scratch is not an easy work. As a result, there were frameworks developed such as GEF and GMF aimed to simplify the construction of graphical editors. Even so, however, it is still though hard for an average programmer to construct a visual graphical editor by using these frameworks without a long time of learning. / Our result is a modeling langauge of graphcial editors called GM3, serving as a bridge betwen developers of graphical editors and the GMF framework. With GM3, the developer can specify the model of his editing domain, how each model element should be presented by which kind of graphical elements in the editor, and how the tool pallete should be filled with various kind of creation and manipulation tools for model elements. After the GM3 specification of an editor is produced, the GM3 transformation engine developed by us using the JavaCC parser generator can be used to generate all files required of the GMF framework and, finally, a subsequent application of the standard GMF code generation procedure can produce a complete graphical editor on Eclipse platform.