Implementation of EasyTime Formal Semantics using a LISA Compiler Generator

TL;DR

This paper presents the implementation of the domain-specific language EasyTime's formal semantics using a LISA compiler generator, facilitating automatic compiler construction for event processing in sports timing systems.

Contribution

It introduces a formal semantics for EasyTime and demonstrates its implementation with LISA, enabling automatic compiler generation from language specifications.

Findings

Successful implementation of EasyTime semantics with LISA

Automated compiler construction from language specifications

Enhanced reliability for sports timing systems

Abstract

A manual measuring time tool in mass sporting competitions would not be imaginable nowadays, because many modern disciplines, such as IRONMAN, last a long-time and, therefore, demand additional reliability. Moreover, automatic timing-devices based on RFID technology, have become cheaper. However, these devices cannot operate as stand-alone because they need a computer measuring system that is capable of processing incoming events, encoding the results, assigning them to the correct competitor, sorting the results according to the achieved times, and then providing a printout of the results. This article presents the domain-specific language EasyTime, which enables the controlling of an agent by writing the events within a database. It focuses, in particular, on the implementation of EasyTime with a LISA tool that enables the automatic construction of compilers from language specifications, using Attribute Grammars.