Verifying the Semantics of Disambiguation Rules: Using Parse Tree Repairing for Showing Safety and Completeness of Associativity and Priority Rules

Context-free grammars (CFGs) provide a well-known formalism for the specification of programming languages. They describe the structure of a program in terms of parse trees. One major issue of CFGs is ambiguity, where one sentence can sometimes have multiple different parse trees. Some formalisms like SDF3 or YACC allow annotating a grammar with...

Robot Block-Based Programming: Teaching children how to program an interactive robot using block-based programming language

Robots play an increasingly large role in society and some material already exists that allows children to program robots in elementary school. However, this material often neglects the interactive capabilities of modern robots. The aim of this project is to teach children how to write interactive programs for a robot. For this purpose, a NAO...