z-logo
Premium
Seshat — a web‐based educational resource for teaching the most common algorithms of lexical analysis
Author(s) -
ArnaizGonzález Álvar,
DíezPastor JoseFrancisco,
RamosPérez Ismael,
GarcíaOsorio César
Publication year - 2018
Publication title -
computer applications in engineering education
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.478
H-Index - 29
eISSN - 1099-0542
pISSN - 1061-3773
DOI - 10.1002/cae.22036
Subject(s) - computer science , parsing , process (computing) , compiler , resource (disambiguation) , automaton , software , programming language , algorithm , rule based machine translation , artificial intelligence , software engineering , computer network
The theoretical background to automata and formal languages represents a complex learning area for students. Computer tools for interacting with the algorithm and interfaces to visualize its different steps can assist the learning process and make it more attractive. In this paper, we present a web application for learning some of the most common algorithms in an appealing way. They are specifically linked to the recognition of regular languages that are, taught in classes on both automata theory and compiler design. Although several simulators are available to students, they usually only serve to validate grammars, automata, and languages, rather than helping students to learn the internal processes that an algorithm can perform. The resource presented here can execute and display each algorithm process, step by step, providing explanations on each step that assist student comprehension. Additionally, as a web‐based resource, it can be used on any device with no need for specific software installation.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here