|File Search||Catalog||Content Search|
Flexc++ generates a scanner class that is ready for use, as well as a member function producing the lexical scanner tokens (lex()). The class can easily be provided with additional members without the need for polymorphic functions. Consequently, classes generated by flexc++ have no virtual members and actually have but one public member: lex(), replacing the old-style flex and flex++ yylex() function.
Flexc++ offers many options, among which an option to define classes generated by flexc++ in a separate namespace. This allows developers to define additional symbols, even outside of the class generated by flexc++, without encountering name-collision problems. With flexc++, artificial means to prevent name-collisions, like the yy-conventions used by flex and flex++ are no longer required. Flexc++ generates C++ code. If C code is required, flex should be used. Flexc++'s grammar requirements are highly compatible with flex's requirements, so converting a flex grammar into a flexc++ grammar should be fairly simple.
In addition to the flexc++ scanner generator itself and several skeleton files, the package contains an extensive man-page, as well as a full manual rewritten after the original flex manual, and several examples.
SemVal | +-------+---------+ | | StateData | | | StateString | more»
See the tech. manual section `Run-time operations'
flexc++(1) flexc++ scanner generator flexc++(1) NAME flexc++ - Generate a C++ scanner class and parsing function SYNOPSIS flexc++ [options] rules-file DESCRIPTION Flexc++(1) was designed after flex(1) and flex++(1). Like these latter two programs flexc++ generates code performing pattern-matching on text, possibly executing act more»
flexc++ (0.98.00-1) unstable; urgency=low [ Frank B. Brokken ] * New upstream release + add more»
flexc++ (0.98.00) * Implemented the --case-insensitive option (and directive), generating a s more»
This package was debianized by Frank B. Brokken <firstname.lastname@example.org> on Sat, 19 Apr 2008 15:29:47 +0 more»