1,380 research outputs found
Scripting game AI : an alternative approach using embedded languages
Scripting is often used in games to enable customisation of
the behaviour of game entities. In this paper we look at the
different approaches taken to introduce scripting in games
and identify the desirable features of a game scripting language. We then present an approach based on the use of embedded languages where a scripting language is implemented
within a general purpose programming language. The approach is compared and contrasted to the other approaches.peer-reviewe
An embedded domain specific language to model, transform and quality assure business processes in business-driven development
In Business-Driven Development (BDD), business
process models are produced by business analysts. To
ensure that the business requirements are satisfied, the
IT solution is directly derived through a process of
model refinement. If models do not contain all the
required technical details or contain errors, the derived
implementation would be incorrect and the BDD
lifecycle would have to be repeated. In this project we
present a functional domain specific language
embedded in Haskell, with which: 1) models can
rapidly be produced in a concise and abstract manner,
2) enables focus on the specifications rather than the
implementation, 3) ensures that all the required details,
to generate the executable code, are specified, 4)
models can be transformed, analysed and interpreted in
various ways, 5) quality assures models by carrying out
three types of checks; by Haskell‟s type checker, at
construction-time and by functions that analyse the
soundness of models, 6) enables users to define quality
assured composite model transformations.peer-reviewe
Automatic definition extraction using parser combinators
The automatic extraction of definitions from natural
language texts has various applications such as the
creation of glossaries and question-answering systems.
In this paper we look at the extraction of definitions
from non-technical texts using parser combinators in
Haskell. We argue that this approach gives a general
and compositional way of characterising natural language definitions. The parsers we develop are shown
to be highly effective in the identification of definitions.
Furthermore, we show how we can also automatically
transform these parsers into other formats to be readily
available for use within an eLearning system.peer-reviewe
- …
