|
libFAUDES
Sections
Types
Functions
|
Functions related to Regular ExpressionsRegular expressions extend the boolean algebra on languages by the Kleene-closure and language concatenation operation. Additionally, functions for the generating elements are provided, i.e. full- and alphabet language. LanguageConcatenateConcatenates two languages.
Detailed description:
With the languages L1 = Lm(G1) and L2 = Lm(G2)
marked by the specified generators, respectively,
the result Lres = Lm(GRes) marks the concatenation
Example:
Parameter Conditions: Arguments may be non-deterministic. The result, however, is converted to a deterministic generator. The C++ API provides an alternative function without the conversion step. KleeneClosureCompute Kleene closure for given language.
Signature:
KleeneClosure(+InOut+ Generator GArg) Detailed description:
This function computes the Kleene-closure L*
of the specified marked language L = Lm(G):
Example:
Parameter Conditions: The argument may be non-deterministic. The core implementation may lead to a non-deterministic result event for deterministic arguments. The wrapper function hence converts to a guarantee for a deterministic result. FullLanguageGenerator with Lm(G)=Sigma*.
Detailed description: For a given alphabet Sigma, construct a generator generating and marking the so called full language Sigma*, i.e. Lm(G)=L(G)=Sigma*. |
libFAUDES 2.16b --- 2010-9-8 --- plugins "example synthesis observer diagnosis hiosys multitasking timed simulator iodevice luabindings"