3 -The '%when condition' syntax was functioning like '$when condition'. This
6 Ragel 5.16 - Nov 20, 2006
7 =========================
8 -Bug fix: the fhold and fexec directives did not function correctly in
9 scanner pattern actions. In this context manipulations of p may be lost or
10 made invalid. To fix this, fexec and fhold now manipulate tokend, which is
11 now always used to update p when the action terminates.
13 Ragel 5.15 - Oct 31, 2006
14 =========================
15 -A language independent test harness was introduced. Test cases can be
16 written using a custom mini-language in the embedded actions. This
17 mini-language is then translated to C, D and Java when generating the
18 language-specific test cases.
19 -Several existing tests have been ported to the language-independent format
20 and a number of new language-independent test cases have been added.
21 -The state-based embedding operators which access states that are not the
22 start state and are not final (the 'middle' states) have changed. They
24 <@/ eof action into middle states
25 <@! error action into middle states
26 <@^ local error action into middle states
27 <@~ to-state action into middle states
28 <@* from-state action into middle states
30 <>/ eof action into middle states
31 <>! error action into middle states
32 <>^ local error action into middle states
33 <>~ to-state action into middle states
34 <>* from-state action into middle states
35 -The verbose form of embeddings using the <- operator have been removed.
36 This syntax was difficult to remember.
37 -A new verbose form of state-based embedding operators have been added.
38 These are like the symbol versions, except they replace the symbols:
40 with literal keywords:
42 -The following words have been promoted to keywords:
43 when eof err lerr to from
44 -The write statment now gets its own lexical scope in the scanner to ensure
45 that commands are passed through as is (not affected by keywords).
46 -Bug fix: in the code generation of fret in scanner actions the adjustment to
47 p that is needed in some cases (dependent on content of patterns) was not
49 -The fhold directive, which decrements p, cannot be permitted in the pattern
50 action of a scanner item because it will not behave consistently. At the end
51 of a pattern action p could be decremented, set to a new value or left
52 alone. This depends on the contents of the scanner's patterns. The user
53 cannot be expected to predict what will happen to p.
54 -Conditions in D code require a cast to the widec type when computing widec.
55 -Like Java, D code also needs if (true) branches for control flow in actions
56 in order to fool the unreachable code detector. This is now abstracted in
57 all code generators using the CTRL_FLOW() function.
58 -The NULL_ITEM value in java code should be -1. This is needed for
61 Ragel 5.14 - Oct 1, 2006
62 ========================
63 -Fixed the check for use of fcall in actions embedded within longest match
64 items. It was emitting an error if an item's longest-match action had an
65 fcall, which is allowed. This bug was introduced while fixing a segfault in
67 -A new minimization option was added: MinimizeMostOps (-l). This option
68 minimizes at every operation except on chains of expressions and chains of
69 terms (eg, union and concat). On these chains it minimizes only at the last
70 operation. This makes test cases with many states compile faster, without
71 killing the performance on grammars like strings2.rl.
72 -The -l minimiziation option was made the default.
73 -Fixes to Java code: Use of the fc value did not work, now fixed. Static data
74 is now declared with the final keyword. Patch from Colin Fleming. Conditions
75 now work when generating Java code.
76 -The option -p was added to rlcodegen which causes printable characters to be
77 printed in GraphViz output. Patch from Colin Fleming.
78 -The "element" keyword no longer exists, removed from vim syntax file.
79 Updated keyword highlighting.
80 -The host language selection is now made in the frontend.
81 -Native host language types are now used when specifying the alphtype.
82 Previously all languages used the set defined by C, and these were mapped to
83 the appropriate type in the backend.
85 Ragel 5.13 - Sep 7, 2006
86 ========================
87 -Fixed a careless error which broke Java code generation.
89 Ragel 5.12 - Sep 7, 2006
90 ========================
91 -The -o flag did not work in combination with -V. This was fixed.
92 -The split code generation format uses only the required number of digits
93 when writing out the number in the file name of each part.
94 -The -T0, -F0 and -G0 codegens should write out the action list iteration
95 variables only when there are regular, to state or from state actions. The
96 code gens should not use anyActions().
97 -If two states have the same EOF actions, they are written out in the finish
99 -The split and in-place goto formats would sometimes generate _out when it is
100 not needed. This was fixed.
101 -Improved the basic partitioning in the split code gen. The last partition
102 would sometimes be empty. This was fixed.
103 -Use of 'fcall *' was not causing top to be initialized. Fixed.
104 -Implemented a Java backend, specified with -J. Only the table-based format
106 -Implemented range compression in the frontend. This has no effect on the
107 generated code, however it reduces the work of the backend and any programs
108 that read the intermediate format.
110 Ragel 5.11 - Aug 10, 2006
111 =========================
112 -Added a variable to the configure.in script which allows the building of
113 the parsers to be turned off (BUILD_PARSERS). Parser building is off by
114 default for released versions.
115 -Removed configure tests for bison defines header file. Use --defines=file
117 -Configure script doesn't test for bison, flex and gperf when building of the
118 parsers is turned off.
119 -Removed check for YYLTYPE structure from configure script. Since shipped
120 code will not build parsers by default, we don't need to be as accomodating
121 of other versions of bison.
122 -Added a missing include that showed up with g++ 2.95.3.
123 -Failed configure test for Objective-C compiler is now silent.
125 Ragel 5.10 - Jul 31, 2006
126 =========================
127 -Moved the check for error state higher in the table-based processing loop.
128 -Replaced naive implementations of condition searching with proper ones. In
129 the table-based formats the searching is also table-based. In the directly
130 executed formats the searching is also directly executable.
131 -The minimization process was made aware of conditions.
132 -A problem with the condition implementation was fixed. Previously we were
133 taking pointers to transitions and then using them after a call to
134 outTransCopy, which was a bad idea because they may be changed by the call.
135 -Added test mailbox3.rl which is based on mailbox2.rl but includes conditions
136 for restricting header and message body lengths.
137 -Eliminated the initial one-character backup of p just before resuming
139 -Added the -s option to the frontend for printing statistics. This currently
140 includes just the number of states.
141 -Sped up the generation of the in-place goto-driven (-G2) code style.
142 -Implemented a split version of in-place goto-driven code style. This code
143 generation style is suitable for producing fast implementations of very
144 large machines. Partitioning is currently naive. In the future a
145 high-quality partitioning program will be employed. The flag for accessing
146 this feature is -Pn, where n is the number of partitions.
147 -Converted mailbox1.rl, strings2.rl and cppscan1.rl tests to support the
148 split code generation.
149 -Fixes and updates were made to the runtests script: added -c for compiling
150 only, changed the -me option to -e, and added support for testing the split
153 Ragel 5.9 - Jul 19, 2006
154 ========================
155 -Fixed a bug in the include system which caused malformed output from the
156 frontend when the include was made from a multi-line machine spec and the
157 included file ended in a single line spec (or vice versa).
158 -Static data is now const.
159 -Actions which referenced states but were not embedded caused the frontend to
161 -Manual now built with pdflatex.
162 -The manual was reorganized and expanded. Chapter sequence is now:
163 Introduction, Constructing Machines, Embedding Actions, Controlling
164 Nondeterminism and Interfacing to the Host program.
166 Ragel 5.8 - Jun 17, 2006
167 ========================
168 -The internal representation of the alphabet type has been encapsulated
169 into a class and all operations on it have been defined as C++ operators.
170 -The condition implementation now supports range transitions. This allows
171 conditions to be embedded into arbitrary machines. Conditions are still
173 -More condition embedding operators were added
174 1. Isolate the start state and embed a condition into all transitions
177 2. Embed a condition into all transitions:
178 when cond OR $when cond OR $?cond
179 3. Embed a condition into pending out transitions:
181 -Improvements were made to the determinization process to support pending out
183 -The Vim sytax file was fixed so that :> doesn't cause the match of a label.
184 -The test suite was converted to a single-file format which uses less disk
185 space than the old directory-per-test format.
187 Ragel 5.7 - May 14, 2006
188 ========================
189 -Conditions will not be embedded like actions because they involve a
190 manipulation of the state machine they are specified in. They have therefore
191 been taken out of the verbose action embedding form (using the <- compound
192 symbol). A new syntax for specifying conditions has been created:
193 m = '\n' when {i==4};
194 -Fixed a bug which prevented state machine commands like fcurs, fcall, fret,
195 etc, from being accounted for in from-state actions and to-state actions.
196 This prevented some necessary support code from being generated.
197 -Implemented condition testing in remaining code generators.
198 -Configure script now checks for gperf, which is required for building.
199 -Added support for case-insensitive literal strings (in addition to regexes).
200 A case-insensitive string is made by appending an 'i' to the literal, as in
202 -Fixed a bug which caused all or expressions inside of all regular
203 expressions to be case-insensitive. For example /[fo]o bar/ would make the
204 [fo] part case-insensitive even though no 'i' was given following the
207 Ragel 5.6 - Apr 1, 2006
208 =======================
209 -Added a left-guarded concatenation operator. This operator <: is equivalent
210 to ( expr1 $1 . expr2 >0 ). It is useful if you want to prefix a sequence
211 with a sequence of a subset of the characters it matches. For example, one
212 can consume leading whitespace before tokenizing a sequence of whitespace
213 separated words: ( ' '* <: ( ' '+ | [a-z]+ )** )
214 -Removed context embedding code, which has been dead since 5.0.
216 Ragel 5.5 - Mar 28, 2006
217 ========================
218 -Implemented a case-insensitive option for regular expressions: /get/i.
219 -If no input file is given to the ragel program it reads from standard input.
220 -The label of the start state has been changed from START to IN to save on
221 required screen space.
222 -Bug fix: \0 was not working in literal strings, due to a change that reduced
223 memory usage by concatenating components of literal strings. Token data
224 length is now passed from the scanner to the paser so that we do not need to
225 rely on null termination.
227 Ragel 5.4 - Mar 12, 2006
228 ========================
229 -Eliminated the default transition from the frontend implementation. This
230 default transition was a space-saving optimization that at best could reduce
231 the number of allocated transitions by one half. Unfortunately it
232 complicated the implementation and this stood in the way of introducing
233 conditionals. The default transition may be reintroduced in the future.
234 -Added entry-guarded concatenation. This operator :>, is syntactic sugar
235 for expr1 $0 . expr >1. This operator terminates the matching of the first
236 machine when a first character of the second machine is matched. For
237 example in any* . ';' we never leave the any* machine. If we use any* :> ';'
238 then the any* machine is terminiated upon matching the semi-colon.
239 -Added finish-guarded concatenation. This operator :>>, is syntactic sugar
240 for expr1 $0 . expr @1. This operator is like entry guarded concatenation
241 except the first machine is terminated when the second machine enters a
242 final state. This is useful for delaying the guard until a full pattern is
243 matched. For example as in '/*' any* :>> '*/'.
244 -Added strong subtraction. Where regular subtraction removes from the first
245 machine any strings that are matched by the second machine, strong
246 subtraction removes any strings from the first that contain any strings of
247 the second as a substring. Strong subtraction is syntactic sugar for
248 expr1 - ( any* expr2 any* ).
249 -Eliminated the use of priorities from the examples. Replaced with
250 subtraction, guarded concatenation and longest-match kleene star.
251 -Did some initial work on supporting conditional transitions. Far from
252 complete and very buggy. This code will only be active when conditionals are
255 Ragel 5.3 - Jan 27, 2006
256 ========================
257 -Added missing semi-colons that cause the build to fail when using older
259 -Fix for D code: if the contents of an fexec is a single word, the generated
260 code will get interpreted as a C-style cast. Adding two brackets prevents
261 this. Can now turn eliminate the "access this.;" in cppscan5 that was used to
262 get around this problem.
263 -Improved some of the tag names in the intermediate format.
264 -Added unsigned long to the list of supported alphabet types.
265 -Added ids of actions and action lists to XML intermediate format. Makes it
267 -Updated to latest Aapl package.
269 Ragel 5.2 - Jan 6, 2006
270 ========================
271 -Ragel emits an error if the target of fentry, fcall, fgoto or fnext is inside
272 a longest match operator, or if an action embedding in a longest match
273 machine uses fcall. The fcall command can still be used in pattern actions.
274 -Made improvements to the clang, rlscan, awkemu and cppscan examples.
275 -Some fixes to generated label names: they should all be prefixed with _.
276 -A fix to the Vim syntax highlighting script was made
277 -Many fixes and updates to the documentation. All important features and
278 concepts are now documented. A second chapter describing Ragel's use
281 Ragel 5.1 - Dec 22, 2005
282 ========================
283 -Fixes to the matching of section delimiters in Vim syntax file.
284 -If there is a longest match machine, the tokend var is now initialized by
285 write init. This is not necessary for correct functionality, however
286 prevents compiler warnings.
287 -The rlscan example was ported to the longest match operator and changed to
289 -Fix to the error handling in the frontend: if there are errors in the lookup
290 of names at machine generation time then do not emit anything.
291 -If not compiling the full machine in the frontend (by using -M), avoid
292 errors and segfaults caused by names that are not part of the compiled
294 -Longest match bug fix: need to init tokstart when returing from fsm calls
295 that are inside longest match actions.
296 -In Graphviz drawing, the arrow into the start state is not a real
297 transition, do not draw to-state actions on the label.
298 -A bug fix to the handling of non-tag data within an XML tag was made.
299 -Backend exit value fixed: since the parser now accepts nothing so as to
300 avoid a redundant parse error when the frontend dies, we must force an
301 error. The backend should now be properly reporting errors.
302 -The longest match machine now has it's start state set final. An LM machine
303 is in a final state when it has not matched anything, when it has matched
304 and accepted a token and is ready for another, and when it has matched a
305 token but is waiting for some lookahead before determining what to do about
306 it (similar to kleene star).
307 -Element statement removed from some tests.
308 -Entry point names are propagated to the backend and used to label the entry
309 point arrows in Graphviz output.
311 Ragel 5.0 - Dec 17, 2005
312 ========================
313 (additional details in V5 release notes)
314 -Ragel has been split into two executables: A frontend which compiles
315 machines and emits them in an XML format, and a backend which generates code
316 or a Graphviz dot file from the XML input. The purpose of this split is to
317 allow Ragel to interface with other tools by means of the XML intermediate
318 format and to reduce complexity by strictly separating the previously
319 entangled phases. The intermediate format will provide a better platform
320 inspecting compiled machines and for extending Ragel to support other host
322 -The host language interface has been reduced significantly. Ragel no longer
323 expects the machine to be implemented as a structure or class and does not
324 generate functions corresponding to initialization, execution and EOF.
325 Instead, Ragel just generates the code of these components, allowing all of
326 them to be placed in a single function if desired. The user specifies a
327 machine in the usual manner, then indicates at which place in the program
328 text the state machine code is to be generated. This is done using the write
329 statement. It is possible to specify to Ragel how it should access the
330 variables it needs (such as the current state) using the access statement.
331 -The host language embedding delimiters have been changed. Single line
332 machines start with '%%' and end at newline. Multiline machines start with
333 '%%{' and end with '}%%'. The machine name is given with the machine
334 statement at the very beginning of the specification. This purpose of this
335 change is to make it easier separate Ragel code from the host language. This
336 will ease the addition of supported host languages.
337 -The structure and class parsing which was previously able to extract a
338 machine's name has been removed since this feature is dependent on the host
339 language and inhibits the move towards a more language-independent frontend.
340 -The init, element and interface statements have been made obsolete by the
341 new host language interface and have been removed.
342 -The fexec action statement has been changed to take only the new position to
343 move to. This statement is more useful for moving backwards and reparsing
344 input than for specifying a whole new buffer entirely and has been shifted
345 to this new use. Giving it only one argument also simplifies the parsing of
346 host code embedded in a Ragel specification. This will ease the addition of
347 supported host languages.
348 -Introduced the fbreak statement, which allows one to stop processing data
349 immediately. The machine ends up in the state that the current transition
350 was to go to. The current character is not changed.
351 -Introduced the noend option for writing the execute code. This inhibits
352 checking if we have reached pe. The machine will run until it goes into the
353 error state or fbreak is hit. This allows one to parse null-terminate
354 strings without first computing the length.
355 -The execute code now breaks out of the processing loop when it moves into
356 the error state. Previously it would run until pe was hit. Breaking out
357 makes the noend option useful when an error is encountered and allows
358 user code to determine where in the input the error occured. It also
359 eliminates needlessly iterating the input buffer.
360 -Introduced the noerror, nofinal and noprefix options for writing the machine
361 data. The first two inhibit the writing of the error state and the
362 first-final state should they not be needed. The noprefix eliminates the
363 prefixing of the data items with the machine name.
364 -Support for the D language has been added. This is specified in the backend
366 -Since the new host language interface has been reduced considerably, Ragel
367 no longer needs to distinguish between C-based languages. Support for C, C++
368 and Objective-C has been folded into one option in the backend: -C
369 -The code generator has been made independent of the languages that it
370 supports by pushing the language dependent apsects down into the lower
371 levels of the code generator.
372 -Many improvements to the longest match construction were made. It is no
373 longer considered experimental. A longest match machine must appear at the
374 top level of a machine instantiation. Since it does not generate a pure
375 state machine (it may need to backtrack), it cannot be used as an operand to
377 -References to the current character and current state are now completely
378 banned in EOF actions.
380 Ragel 4.2 - Sep 16, 2005
381 ========================
382 (additional details in V4 release notes)
383 -Fixed a bug in the longest match operator. In some states it's possible that
384 we either match a token or match nothing at all. In these states we need to
385 consult the LmSwitch on error so it must be prepared to execute an error
386 handler. We therefore need to init act to this error value (which is zero).
387 We can compute if we need to do this and the code generator emits the
388 initialization only if necessary.
389 -Changed the definition of the token end of longest match actions. It now
390 points to one past the last token. This makes computing the token length
391 easier because you don't have to add one. The longest match variables token
392 start, action identifier and token end are now properly initialized in
393 generated code. They don't need to be initialized in the user's code.
394 -Implemented to-state and from-state actions. These actions are executed on
395 transitions into the state (after the in transition's actions) and on
396 transitions out of the state (before the out transition's actions). See V4
397 release notes for more information.
398 -Since there are no longer any action embedding operators that embed both on
399 transitions and on EOF, any actions that exist in both places will be there
400 because the user has explicitly done so. Presuming this case is rare, and
401 with code duplication in the hands of the user, we therefore give the EOF
402 actions their own action switch in the finish() function. This is further
403 motivated by the fact that the best solution is to do the same for to-state
404 and from-state actions in the main loop.
405 -Longest match actions can now be specified using a named action. Since a
406 word following a longest match item conflicts with the concatenation of a
407 named machine, the => symbol must come immediately before a named action.
408 -The longest match operator permits action and machine definitions in the
409 middle of a longest match construction. These are parsed as if they came
410 before the machine definition they are contained in. Permitting action and
411 machine definitions in a longest match construction allows objects to be
412 defined closer to their use.
413 -The longest match operator can now handle longest match items with no
414 action, where previously Ragel segfaulted.
415 -Updated to Aapl post 2.12.
416 -Fixed a bug in epsilon transition name lookups. After doing a name lookup
417 the result was stored in the parse tree. This is wrong because if a machine
418 is used more than once, each time it may resolve to different targets,
419 however it will be stored in the same place. We now store name resolutions
420 in a separated data structure so that each walk of a parse tree uses the
421 name resolved during the corresponding walk in the name lookup pass.
422 -The operators used to embed context and actions into states have been
423 modified. The V4 release notes contain the full details.
424 -Added zlen builtin machine to represent the zero length machine. Eventually
425 the name "null" will be phased out in favour of zlen because it is unclear
426 whether null matches the zero length string or if it does not match any
427 string at all (as does the empty builtin).
428 -Added verbose versions of action, context and priority embedding. See the V4
429 release notes for the full details. A small example:
430 machine <- all exec { foo(); } <- final eof act1
431 -Bugfix for machines with epsilon ops, but no join operations. I had
432 wrongfully assumed that because epsilon ops can only increase connectivity,
433 that no states are ever merged and therefore a call to fillInStates() is not
434 necessary. In reality, epsilon transitions within one machine can induce the
435 merging of states. In the following, state 2 follows two paths on 'i':
436 main := 'h' -> i 'i h' i: 'i';
437 -Changed the license of the guide from a custom "do not propagate modified
438 versions of this document" license to the GPL.
440 Ragel 4.1 - Jun 26, 2005
441 ========================
442 (additional details in V4 release notes)
443 -A bug in include processing was fixed. Surrounding code in an include file
444 was being passed through to the output when it should be ignored. Includes
445 are only for including portions of another machine into he current. This
446 went unnoticed because all tested includes were wrapped in #ifndef ...
447 #endif directives and so did not affect the compilation of the file making
449 -Fixes were made to Vim syntax highlighting file.
450 -Duplicate actions are now removed from action lists.
451 -The character-level negation operator ^ was added. This operator produces a
452 machine that matches single characters that are not matched by the machine
453 it is applied to. This unary prefix operator has the same precedence level
455 -The use of + to specify the a positive literal number was discontinued.
456 -The parser now assigns the subtraction operator a higher precedence than
457 the negation of literal number.
459 Ragel 4.0 - May 26, 2005
460 ========================
461 (additional details in V4 release notes)
462 -Operators now strictly embed into a machine either on a specific class of
463 characters or on EOF, but never both. This gives a cleaner association
464 between the operators and the physical state machine entitites they operate
465 on. This change is made up of several parts:
466 1. '%' operator embeds only into leaving characters.
467 2. All global and local error operators only embed on error character
468 transitions, their action will not be triggerend on EOF in non-final
470 3. EOF action embedding operators have been added for all classes of states
471 to make up for functionality removed from other operators. These are
473 4. Start transition operator '>' no longer implicitly embeds into leaving
474 transtions when start state is final.
475 -Ragel now emits warnings about the improper use of statements and values in
476 action code that is embedded as an EOF action. Warnings are emitted for fpc,
477 fc, fexec, fbuf and fblen.
478 -Added a longest match construction operator |* machine opt-action; ... *|.
479 This is for repetition where an ability to revert to a shorter, previously
480 matched item is required. This is the same behaviour as flex and re2c. The
481 longest match operator is not a pure FSM construction, it introduces
482 transitions that implicitly hold the current character or reset execution to
483 a previous location in the input. Use of this operator requires the caller
484 of the machine to occasionally hold onto data after a call to the exectute
485 routine. Use of machines generated with this operator as the input to other
486 operators may have undefined results. See examples/cppscan for an example.
487 This is very experimental code.
488 -Action ids are only assigned to actions that are referenced in the final
489 constructed machine, preventing gaps in the action id sequence. Previously
490 an action id was assigned if the action was referenced during parsing.
491 -Machine specifications now begin with %% and are followed with an optional
492 name and either a single Ragel statement or a sequence of statements
494 -Ragel no longer generates the FSM's structure or class. It is up to the user
495 to declare the structure and to give it a variable named curs of type
496 integer. If the machine uses the call stack the user must also declare a
497 array of integers named stack and an integer variable named top.
498 -In the case of Objective-C, Ragel no longer generates the interface or
499 implementation directives, allowing the user to declare additional methods.
500 -If a machine specification does not have a name then Ragel tries to find a
501 name for it by first checking if the specification is inside a struct, class
502 or interface. If it is not then it uses the name of the previous machine
503 specification. If still no name is found then this is an error.
504 -Fsm specifications now persist in memory and statements accumulate.
505 -Ragel now has an include statement for including the statements of a machine
506 spec in another file (perhaps because it is the corresponding header file).
507 The include statement can also be used to draw in the statements of another
508 fsm spec in the current file.
509 -The fstack statement is now obsolete and has been removed.
510 -A new statement, simply 'interface;', indicates that ragel should generate
511 the machine's interface. If Ragel sees the main machine it generates the
512 code sections of the machine. Previously, the header portion was generated
513 if the (now removed) struct statement was found and code was generated if
514 any machine definition was found.
515 -Fixed a bug in the resolution of fsm name references in actions. The name
516 resolution code did not recurse into inline code items with children
517 (fgoto*, fcall*, fnext*, and fexec), causing a segfault at code generation
519 -Cleaned up the code generators. FsmCodeGen was made into a virtual base
520 class allowing for the language/output-style specific classes to inherit
521 both a language specific and style-specific base class while retaining only
522 one copy of FsmCodeGen. Language specific output can now be moved into the
523 language specific code generators, requiring less duplication of code in the
524 language/output-style specific leaf classes.
525 -Fixed bugs in fcall* implementation of IpgGoto code generation.
526 -If the element type has not been defined Ragel now uses a constant version
527 of the alphtype, not the exact alphtype. In most cases the data pointer of
528 the execute routine should be const. A non-const element type can still be
529 defined with the element statement.
530 -The fc special value now uses getkey for retrieving the current char rather
531 than *_p, which is wrong if the element type is a structure.
532 -User guide converted to TeX and updated for new 4.0 syntax and semantics.
534 Ragel 3.7 - Oct 31, 2004
535 ========================
536 -Bug fix: unreferenced machine instantiations causing segfault due to name
537 tree and parse tree walk becomming out of syncronization.
538 -Rewrote representation of inline code blocks using a tree data structure.
539 This allows special keywords such as fbuf to be used as the operatands of
541 -Documentation updates.
542 -When deciding whether or not to generate machine instantiations, search the
543 entire name tree beneath the instantiation for references, not just the
545 -Removed stray ';' in keller2.rl
546 -Added fexec for restarting the machine with new buffer data (state stays the
547 same), fbuf for retrieving the the start of the buf, and fblen for
548 retrieving the orig buffer length.
549 -Implemented test/cppscan2 using fexec. This allows token emitting and restart
550 to stay inside the execute routine, instead of leaving and re-entering on
552 -Changed examples/cppscan to use fexec and thereby go much faster.
553 -Implemented flex and re2c versions of examples/cppscan. Ragel version
554 goes faster than flex version but not as fast as re2c version.
555 -Merged in Objective-C patch from Eric Ocean.
556 -Turned off syncing with stdio in C++ tests to make them go faster.
557 -Renamed C++ code generaion classes with the Cpp Prefix instead of CC to make
559 -In the finish function emit fbuf as 0 cast to a pointer to the element type
560 so it's type is not interpreted as an integer.
561 -The number -128 underflows char alphabets on some architectures. Removed
563 -Disabled the keller2 test because it causes problems on many architectures
564 due to its large size and compilation requirements.
566 Ragel 3.6 - Jul 10, 2004
567 ========================
568 -Many documentation updates.
569 -When resolving names, return a set of values so that a reference in an
570 action block that is embedded more than once won't report distinct entry
571 points that are actually the same.
572 -Implemented flat tables. Stores a linear array of indicies into the
573 transition array and only a low and high key value. Faster than binary
574 searching for keys but not usable for large alphabets.
575 -Fixed bug in deleting of transitions leftover from converstion from bst to
576 list implementation of transitions. Other code cleanup.
577 -In table based output calculate the cost of using an index. Don't use if
579 -Changed fstate() value available in init and action code to to fentry() to
580 reflect the fact that the values returned are intended to be used as targets
581 in fgoto, fnext and fcall statements. The returned state is not a unique
582 state representing the label. There can be any number of states representing
584 -Added keller2 test, C++ scanning tests and C++ scanning example.
585 -In table based output split up transitions into targets and actions. This
586 allows actions to be omitted.
587 -Broke the components of the state array into separate arrays. Requires
588 adding some fields where they could previously be omitted, however allows
589 finer grained control over the sizes of items and an overal size reduction.
590 Also means that state numbers are not an offset into the state array but
591 instead a sequence of numbers, meaning the context array does not have any
593 -Action lists and transition also have their types chosen to be the smallest
594 possible for accomodating the contained values.
595 -Changed curs state stored in fsm struct from _cs to curs. Keep fsm->curs ==
596 -1 while in machine. Added tests curs1 and curs2.
597 -Implemented the notion of context. Context can be embedded in states using
598 >:, $:, @: and %: operators. These embed a named context into start states,
599 all states, non-start/non-final and final states. If the context is declared
600 using a context statment
602 then the context can be quered for any state using fsm_name_ctx_name(state)
603 in C code and fsm_name::ctx_name(state) in C++ code. This feature makes it
604 possible to determine what "part" of the machine is currently active.
605 -Fixed crash on machine generation of graphs with no final state. If there
606 is no reference to a final state in a join operation, don't generate one.
607 -Updated Vim sytax: added labels to inline code, added various C++ keywords.
608 Don't highlight name separations as labels. Added switch labels, improved
609 alphtype, element and getkey.
610 -Fixed line info in error reporting of bad epsilon trans.
611 -Fixed fstate() for tab code gen.
612 -Removed references to malloc.h.
614 Ragel 3.5 - May 29, 2004
615 ========================
616 -When parse errors occur, the partially generated output file is deleted and
617 an non-zero exit status is returned.
618 -Updated Vim syntax file.
619 -Implemented the setting of the element type that is passed to the execute
620 routine as well as method for specifying how ragel should retrive the key
621 from the element type. This lets ragel process arbitrary structures inside
622 of which is the key that is parsed.
623 element struct Element;
624 getkey fpc->character;
625 -The current state is now implemented with an int across all machines. This
626 simplifies working with current state variables. For example this allows a
627 call stack to be implemented in user code.
628 -Implemented a method for retrieving the current state, the target state, and
630 fcurs -retrieve the current state
631 ftargs -retrieve the target state
632 fstate(name) -retrieve a named state.
633 -Implemented a mechanism for jumping to and calling to a state stored in a
635 fgoto *<expr>; -goto the state returned by the C/C++ expression.
636 fcall *<expr>; -call the state returned by the C/C++ expression.
637 -Implemented a mechanism for specifying the next state without immediately
638 transfering control there (any code following statement is executed).
639 fnext label; -set the state pointed to by label as the next state.
640 fnext *<expr>; -set the state returned by the C/C++ expression as the
642 -Action references are determined from the final machine instead of during
643 the parse tree walk. Some actions can be referenced in the parse tree but not
644 show up in the final machine. Machine analysis is now done based on this new
646 -Named state lookup now employs a breadth-first search in the lookup and
647 allows the user to fully qualify names, making it possible to specify
648 jumps/calls into parts of the machine deep in the name hierarchy. Each part
649 of name (separated by ::) employs a breadth first search from it's starting
651 -Name references now must always refer to a single state. Since references to
652 multiple states is not normally intended, it no longer happens
653 automatically. This frees the programmer from thinking about whether or not
654 a state reference is unique. It also avoids the added complexity of
655 determining when to merge the targets of multiple references. The effect of
656 references to multiple states can be explicitly created using the join
657 operator and epsilon transitions.
658 -M option was split into -S and -M. -S specifies the machine spec to generate
659 for graphviz output and dumping. -M specifies the machine definition or
661 -Machine function parameters are now prefixed with and underscore to
662 avoid the hiding of class members.
664 Ragel 3.4 - May 8, 2004
665 =======================
666 -Added the longest match kleene star operator **, which is synonymous
667 with ( ( <machine> ) $0 %1 ) *.
668 -Epsilon operators distinguish between leaving transitions (going to an
669 another expression in a comma separated list) and non-leaving transitions.
670 Leaving actions and priorities are appropriately transferred.
671 -Relative priority of following ops changed to:
675 If label is done first then the isolation of the start state in > operators
676 will cause the label to point to the old start state that doesn't have the
678 -Merged >! and >~, @! and @~, %! and %~, and $! and $~ operators to have one
679 set of global error action operators (>!, @!, %! and $!) that are invoked on
680 error by unexpected characters as well as by unexepected EOF.
681 -Added the fpc keyword for use in action code. This is a pointer to the
682 current character. *fpc == fc. If an action is invoked on EOF then fpc == 0.
683 -Added >^, @^, %^, and $^ local error operators. Global error operators (>!,
684 @!, $!, and %!) cause actions to be invoked if the final machine fails.
685 Local error actions cause actions to be invoked if if the current machine
687 -Changed error operators to mean embed global/local error actions in:
688 >! and !^ -the start state.
689 @! and @^ -states that are not the start state and are not final.
690 %! and %^ -final states.
691 $! and $^ -all states.
692 -Added >@! which is synonymous >! then @!
693 -Added >@^ which is synonymous >^ then @^
694 -Added @%! which is synonymous @! then %!
695 -Added @%^ which is synonymous >^ then @^
696 -FsmGraph representation of transition lists was changed from a mapping of
697 alphabet key -> transition objects using a BST to simply a list of
698 transition objects. Since the transitions are no longer divided by
699 single/range, the fast finding of transition objects by key is no longer
700 required functionality and can be eliminated. This new implementation uses
701 the same amount of memory however causes less allocations. It also make more
702 sense for supporting error transitions with actions. Previously an error
703 transition was represented by a null value in the BST.
704 -Regular expression ranges are checked to ensure that lower <= upper.
705 -Added printf-like example.
706 -Added atoi2, erract2, and gotcallret to the test suite.
707 -Improved build test to support make -jN and simplified the compiling and
710 Ragel 3.3 - Mar 7, 2004
711 =========================
712 -Portability bug fixes were made. Minimum and maximum integer values are
713 now taken from the system. An alignment problem on 64bit systems
716 Ragel 3.2 - Feb 28, 2004
717 ========================
718 -Added a Vim syntax file.
719 -Eliminated length var from generated execute code in favour of an end
720 pointer. Using length requires two variables be read and written. Using an
721 end pointer requires one variable read and written and one read. Results in
722 more optimizable code.
723 -Minimization is now on by default.
724 -States are ordered in output by depth first search.
725 -Bug in minimization fixed. States were not being distinguished based on
727 -Added null and empty builtin machines.
728 -Added EOF error action operators. These are >~, >@, $~, and %~. EOF error
729 operators embed actions to take if the EOF is seen and interpreted as an
730 error. The operators correspond to the following states:
732 -any state with a transition to a final state
733 -any state with a transiion out
735 -Fixed bug in generation of unreference machine vars using -M. Unreferenced
736 vars don't have a name tree built underneath when starting from
737 instantiations. Need to instead build the name tree starting at the var.
738 -Calls, returns, holds and references to fc in out action code are now
739 handled for ipgoto output.
740 -Only actions referenced by an instantiated machine expression are put into
741 the action index and written out.
742 -Added rlscan, an example that lexes Ragel input.
744 Ragel 3.1 - Feb 18, 2004
745 ========================
746 -Duplicates in OR literals are removed and no longer cause an assertion
748 -Duplicate entry points used in goto and call statements are made into
749 deterministic entry points.
750 -Base FsmGraph code moved from aapl into ragel, as an increasing amount
751 of specialization is required. Too much time was spent attempting to
752 keep it as a general purpose template.
753 -FsmGraph code de-templatized and heirarchy squashed to a single class.
754 -Single transitions taken out of FsmGraph code. In the machine construction
755 stage, transitions are now implemented only with ranges and default
756 transtions. This reduces memory consumption, simplifies code and prevents
757 covered transitions. However it requires the automated selection of single
758 transitions to keep goto-driven code lean.
759 -Machine reduction completely rewritten to be in-place. As duplicate
760 transitions and actions are found and the machine is converted to a format
761 suitable for writing as C code or as GraphViz input, the memory allocated
762 for states and transitions is reused, instead of newly allocated.
763 -New reduction code consolodates ranges, selects a default transition, and
764 selects single transitions with the goal of joining ranges that are split by
765 any number of single characters.
766 -Line directive changed from "# <num> <file>" to the more common format
767 "#line <num> <file>".
768 -Operator :! changed to @!. This should have happened in last release.
769 -Added params example.
771 Ragel 3.0 - Jan 22, 2004
772 ========================
773 -Ragel now parses the contents of struct statements and action code.
774 -The keyword fc replaces the use of *p to reference the current character in
776 -Machine instantiations other than main are allowed.
777 -Call, jump and return statements are now available in action code. This
778 facility makes it possible to jump to an error handling machine, call a
779 sub-machine for parsing a field or to follow paths through a machine as
780 determined by arbitrary C code.
781 -Added labels to the language. Labels can be used anywhere in a machine
782 expression to define an entry point. Also references to machine definitions
783 cause the implicit creation of a label.
784 -Added epsilon transitions to the language. Epsilon operators may reference
785 labels in the current name scope resolved when join operators are evaluated
786 and at the root of the expression tree of machine assignment/instantiation.
787 -Added the comma operator, which joins machines together without drawing any
788 transitions between them. This operator is useful in combination with
789 labels, the epsilon operator and user code transitions for defining machines
790 using the named state and transition list paradigm. It is also useful for
791 invoking transitions based on some analysis of the input or on the
793 -Added >!, :!, $!, %! operators for specifying actions to take should the
794 machine fail. These operators embed actions to execute if the machine
797 -any state with a transition to a final state
798 -any state with a transiion out
800 The general rule is that if an action embedding operator embeds an action
801 into a set of transitions T, then the error-counterpart with a ! embeds an
802 action into the error transition taken when any transition T is a candidate,
803 but does not match the input.
804 -The finishing augmentation operator ':' has been changed to '@'. This
805 frees the ':' symbol for machine labels and avoids hacks to the parser to
806 allow the use of ':' for both labels and finishing augmentations. The best
807 hack required that label names be distinct from machine definition names as
808 in main := word : word; This restriction is not good because labels are
809 local to the machine that they are used in whereas machine names are global
810 entities. Label name choices should not be restricted by the set of names
811 that are in use for machines.
812 -Named priority syntax now requires parenthesis surrounding the name and
813 value pair. This avoids grammar ambiguities now that the ',' operator has
814 been introduced and makes it more clear that the name and value are an
816 -Backslashes are escaped in line directive paths.
818 Ragel 2.2 - Oct 6, 2003
819 =======================
820 -Added {n}, {,n}, {n,} {n,m} repetition operators.
821 <expr> {n} -- exactly n repetitions
822 <expr> {,n} -- zero to n repetitions
823 <expr> {n,} -- n or more repetitions
824 <expr> {n,m} -- n to m repetitions
825 -Bug in binary search table in Aapl fixed. Fixes crashing on machines that
826 add to action tables that are implicitly shared among transitions.
827 -Tests using obsolete minimization algorithms are no longer built and run by
829 -Added atoi and concurrent from examples to the test suite.
831 Ragel 2.1 - Sep 22, 2003
832 ========================
833 -Bug in priority comparison code fixed. Segfaulted on some input with many
835 -Added two new examples.
837 Ragel 2.0 - Sep 7, 2003
838 =======================
839 -Optional (?), One or More (+) and Kleene Star (*) operators changed from
840 prefix to postfix. Rationale is that postfix version is far more common in
841 regular expression implementations and will be more readily understood.
842 -All priority values attached to transitions are now accompanied by a name.
843 Transitions no longer have default priority values of zero assigned
844 to them. Only transitions that have different priority values assigned
845 to the same name influence the NFA-DFA conversion. This scheme reduces
846 side-effects of priorities.
847 -Removed the %! statement for unsetting pending out priorities. With
848 named priorities, it is not necessary to clear the priorities of a
849 machine with $0 %! because non-colliding names can be used to avoid
851 -Removed the clear keyword, which was for removing actions from a machine.
852 Not required functionality and it is non-intuitive to have a language
853 feature that undoes previous definitions.
854 -Removed the ^ modifier to repetition and concatenation operators. This
855 undocumented feature prevented out transitions and out priorities from being
856 transfered from final states to transitions leaving machines. Not required
857 functionality and complicates the language unnecessarily.
858 -Keyword 'func' changed to 'action' as a part of the phasing out of the term
859 'function' in favour of 'action'. Rationale is that the term 'function'
860 implies that the code is called like a C function, which is not necessarily
861 the case. The term 'action' is far more common in state machine compiler
863 -Added the instantiation statement, which looks like a standard variable
864 assignment except := is used instead of =. Instantiations go into the
865 same graph dictionary as definitions. In the the future, instantiations
866 will be used as the target for gotos and calls in action code.
867 -The main graph should now be explicitly instantiated. If it is not,
869 -Or literal basic machines ([] outside of regular expressions) now support
871 -C and C++ interfaces lowercased. In the C interface an underscore now
872 separates the fsm machine and the function name. Rationale is that lowercased
873 library and generated routines are more common.
875 int fsm_init( struct clang *fsm );
876 int fsm_execute( struct clang *fsm, char *data, int dlen );
877 int fsm_finish( struct clang *fsm );
880 int fsm::execute( char *data, int dlen );
882 -Init, execute and finish all return -1 if the machine is in the error state
883 and can never accept, 0 if the machine is in a non-accepting state that has a
884 path to a final state and 1 if the machine is in an accepting state.
885 -Accept routine eliminated. Determining whether or not the machine accepts is
886 done by examining the return value of the finish routine.
887 -In C output, fsm structure is no longer a typedef, so referencing requires
888 the struct keyword. This is to stay in line with C language conventions.
889 -In C++ output, constructor is no longer written by ragel. As a consequence,
890 init routine is not called automatically. Allows constructor to be supplied
891 by user as well as the return value of init to be examined without calling it
893 -Static start state and private structures are taken out of C++ classes.
895 Ragel 1.5.4 - Jul 14, 2003
896 ==========================
897 -Workaround for building with bison 1.875, which produces an
898 optimization that doesn't build with newer version gcc.
900 Ragel 1.5.3 - Jul 10, 2003
901 ==========================
902 -Fixed building with versions of flex that recognize YY_NO_UNPUT.
903 -Fixed version numbers in ragel.spec file.
905 Ragel 1.5.2 - Jul 7, 2003
906 =========================
907 -Transition actions and out actions displayed in the graphviz output.
908 -Transitions on negative numbers handled in graphviz output.
909 -Warning generated when using bison 1.875 now squashed.
911 Ragel 1.5.1 - Jun 21, 2003
912 ==========================
913 -Bugs fixed: Don't delete the output objects when writing to standard out.
914 Copy mem into parser buffer with memcpy, not strcpy. Fixes buffer mem errror.
915 -Fixes for compiling with Sun WorkShop 6 compilers.
917 Ragel 1.5.0 - Jun 10, 2003
918 ==========================
919 -Line directives written to the output so that errors in the action code
920 are properly reported in the ragel input file.
921 -Simple graphviz dot file output format is supported. Shows states and
922 transitions. Does not yet show actions.
923 -Options -p and -f dropped in favour of -d output format.
924 -Added option -M for specifying the machine to dump with -d or the graph to
926 -Error recovery implemented.
927 -Proper line and column number tracking implemented in the scanner.
928 -All action/function code is now embedded in the main Execute routine. Avoids
929 duplication of action code in the Finish routine and the need to call
930 ExecFuncs which resulted in huge code bloat. Will also allow actions to
931 modify cs when fsm goto, call and return is supported in action code.
932 -Fsm spec can have no statements, nothing will be generated.
933 -Bug fix: Don't accept ] as the opening of a .-. range a reg exp.
934 -Regular expression or set ranges (ie /[0-9]/) are now handled by the parser
935 and consequently must be well-formed. The following now generates a parser
936 error: /[+-]/ and must be rewritten as /[+\-]/. Also fixes a bug whereby ]
937 might be accepted as the opening of a .-. range causing /[0-9]-[0-9]/ to
939 -\v, \f, and \r are now treated as whitespace in an fsm spec.
941 Ragel 1.4.1 - Nov 19, 2002
942 ==========================
943 -Compile fixes. The last release (integer alphabets) was so exciting
944 that usual portability checks got bypassed.
946 Ragel 1.4.0 - Nov 19, 2002
947 ==========================
948 -Arbitrary integer alphabets are now fully supported! A new language
950 'alphtype <type>' added for specifying the type of the alphabet. Default
951 is 'char'. Possible alphabet types are:
952 char, unsigned char, short, unsigned short, int, unsigned int
953 -Literal machines specified in decimal format can now be negative when the
954 alphabet is a signed type.
955 -Literal machines (strings, decimal and hex) have their values checked for
956 overflow/underflow against the size of the alphabet type.
957 -Table driven and goto driven output redesigned to support ranges. Table
958 driven uses a binary search for locating single characters and ranges. Goto
959 driven uses a switch statement for single characters and nested if blocks for
961 -Switch driven output removed due to a lack of consistent advantages. Most of
962 the time the switch driven FSM is of no use because the goto FSM makes
963 smaller and faster code. Under certain circumstances it can produce smaller
964 code than a goto driven fsm and be almost as fast, but some sporadic case
965 does not warrant maintaining it.
966 -Many warnings changed to errors.
967 -Added option -p for printing the final fsm before minimization. This lets
968 priorities be seen. Priorties are all reset to 0 before minimization. The
969 exiting option -f prints the final fsm after minimization.
970 -Fixed a bug in the clang test and example that resulted in redundant actions
973 Ragel 1.3.4 - Nov 6, 2002
974 =========================
975 -Fixes to Chapter 1 of the guide.
976 -Brought back the examples and made them current.
977 -MSVC is no longer supported for compiling windows binaries because its
978 support for the C++ standard is frustratingly inadequate, it will cost money
979 to upgrade if it ever gets better, and MinGW is a much better alternative.
980 -The build system now supports the --host= option for building ragel
981 for another system (used for cross compiling a windows binary with MinGW).
982 -Various design changes and fixes towards the goal of arbitrary integer
983 alphabets and the handling of larger state machines were made.
984 -The new shared vector class is now used for action lists in transitions and
985 states to reduce memory allocations.
986 -An avl tree is now used for the reduction of transitions and functions of an
987 fsm graph before making the final machine. The tree allows better scalability
988 and performance by not requiring consecutively larger heap allocations.
989 -Final stages in the separation of fsm graph code from action embedding and
990 priority assignment is complete. Makes the base graph leaner and easier to reuse
991 in other projects (like Keller).
993 Ragel 1.3.3 - Oct 22, 2002
994 ==========================
995 -More diagrams were added to section 1.7.1 of the user guide.
996 -FSM Graph code was reworked to spearate the regex/nfa/minimizaion graph
997 algorithms from the manipulation of state and transition properties.
998 -An rpm spec file from Cris Bailiff was added. This allows an rpm for ragel
999 to be built with the command 'rpm -ta ragel-x.x.x.tar.gz'
1000 -Fixes to the build system and corresponding doc updates in the README.
1001 -Removed autil and included the one needed source file directly in the top
1002 level ragel directory.
1003 -Fixed a bug that nullified the 20 times speedup in large compilations
1004 claimed by the last version.
1005 -Removed awk from the doc build (it was added with the last release -- though
1006 not mentioned in the changelog).
1007 -Install of man page was moved to the doc dir. The install also installs the
1008 user guide to $(PREFIX)/share/doc/ragel/
1010 Ragel 1.3.2 - Oct 16, 2002
1011 ==========================
1012 -Added option -v (or --version) to show version information.
1013 -The subtract operator no longer removes transition data from the machine
1014 being subtracted. This is left up to the user for the purpose of making it
1015 possible to transfer transitions using subtract and also for speeding up the
1016 subtract routine. Note that it is possible to explicitly clear transition
1017 data before a doing a subtract.
1018 -Rather severe typo bug fixed. Bug was related to transitions with higher
1019 priorities taking precedence. A wrong ptr was being returned. It appears to
1020 have worked most of the time becuase the old ptr was deleted and the new one
1021 allocated immediatly after so the old ptr often pointed to the same space.
1023 -Bug in the removing of dead end paths was fixed. If the start state
1024 has in transitions then those paths were not followed when finding states to
1025 keep. Would result in non-dead end states being removed from the graph.
1026 -In lists and in ranges are no longer maintained as a bst with the key as the
1027 alphabet character and the value as a list of transitions coming in on that
1028 char. There is one list for each of inList, inRange and inDefault. Now that
1029 the required functionality of the graph is well known it is safe to remove
1030 these lists to gain in speed and footprint. They shouldn't be needed.
1031 -IsolateStartState() runs on modification of start data only if the start
1032 state is not already isolated, which is now possible with the new in list
1034 -Concat, Or and Star operators now use an approximation to
1035 removeUnreachableStates that does not require a traversal of the entire
1036 graph. This combined with an 'on-the-fly' management of final bits and final
1037 state status results is a dramatic speed increase when compiling machines
1038 that use those operators heavily. The strings2 test goes 20 times faster.
1039 -Before the final minimization, after all fsm operations are complete,
1040 priority data is reset which enables better minimization in cases where
1041 priorities would otherwise separate similar states.
1043 Ragel 1.3.1 - Oct 2, 2002
1044 =========================
1045 -Range transitions are now used to implement machines made with /[a-z]/ and
1046 the .. operator as well as most of the builtin machines. The ranges are not
1047 yet reflected in the output code, they are expanded as if they came from the
1048 regular single transitions. This is one step closer to arbitrary integer
1050 -The builtin machine 'any' was added. It is equiv to the builtin extend,
1051 matching any characters.
1052 -The builtin machine 'cntrl' now includes newline.
1053 -The builtin machine 'space' now includes newline.
1054 -The builtin machine 'ascii' is now the range 0-127, not all characters.
1055 -A man page was written.
1056 -A proper user guide was started. Chapter 1: Specifying Ragel Programs
1057 was written. It even has some diagrams :)
1059 Ragel 1.3.0 - Sept 4, 2002
1060 ==========================
1061 -NULL keyword no longer used in table output.
1062 -Though not yet in use, underlying graph structure changed to support range
1063 transitions. As a result, most of the code that walks transition lists is now
1064 implemented with an iterator that hides the complexity of the transition
1065 lists and ranges. Range transitions will be used to implement /[a-z]/ style
1066 machines and machines made with the .. operator. Previously a single
1067 transition would be used for each char in the range, which is very costly.
1068 Ranges eliminate much of the space complexity and allow for the .. operator
1069 to be used with very large (integer) alphabets.
1070 -New minimization similar to Hopcroft's alg. It does not require n^2 space and
1071 runs close to O(n*log(n)) (an exact analysis of the alg is very hard). It is
1072 much better than the stable and approx minimization and obsoletes them both.
1073 An exact implementation of Hopcroft's alg is desirable but not possible
1074 because the ragel implementation does not assume a finite alphabet, which
1075 Hopcroft's requires. Ragel will support arbitrary integer alphabets which
1076 must be treated as an infinite set for implementation considerations.
1077 -New option -m using above described minimization to replace all previous
1078 minimization options. Old options sill work but are obsolete and not
1080 -Bug fixed in goto style output. The error exit set the current state to 0,
1081 which is actually a valid state. If the machine was entered again it would go
1082 into the first state, very wrong. If the first state happened to be final then
1083 an immediate finish would accept when in fact it should fail.
1084 -Slightly better fsm minimization now capable due to clearing of the
1085 transition ordering numbers just prior to minimization.
1087 Ragel 1.2.2 - May 25, 2002
1088 ==========================
1089 -Configuration option --prefix now works when installing.
1090 -cc file extension changed to cpp for better portability.
1091 -Unlink of output file upon error no longer happens, removes dependency on
1092 unlink system command.
1093 -All multiline strings removed: not standard c++.
1094 -Awk build dependency removed.
1095 -MSVC 6.0 added to the list of supported compilers (with some tweaking of
1096 bison and flex output).
1098 Ragel 1.2.1 - May 13, 2002
1099 ==========================
1100 -Automatic dependencies were fixed, they were not working correctly.
1101 -Updated AUTHORS file to reflect contributors.
1102 -Code is more C++ standards compliant: compiles with g++ 3.0
1103 -Fixed bugs that only showed up in g++ 3.0
1104 -Latest (unreleased) Aapl.
1105 -Configuration script bails out if bison++ is installed. Ragel will not
1106 compile with bison++ because it is coded in c++ and bison++ automatically
1107 generates a c++ parser. Ragel uses a c-style bison parser.
1109 Ragel 1.2.0 - May 3, 2002
1110 =========================
1111 -Underlying graph structure now supports default transitions. The result is
1112 that a transition does not need to be made for each char of the alphabet
1113 when making 'extend' or '/./' machines. Ragel compiles machines that
1114 use the aforementioned primitives WAY faster.
1115 -The ugly hacks needed to pick default transitions now go away due to
1116 the graph supporting default transitions directly.
1117 -If -e is given, but minimization is not turned on, print a warning.
1118 -Makefiles use automatic dependencies.
1120 Ragel 1.1.0 - April 15, 2002
1121 ============================
1122 -Added goto fsm: much faster than any other fsm style.
1123 -Default operator (if two machines are side by side with no operator
1124 between them) is concatenation. First showed up in 1.0.4.
1125 -The fsm machine no longer auotmatically builds the flat table for
1126 transition indicies. Instead it keeps the key,ptr pair. In tabcodegen
1127 the flat table is produced. This way very large alphabets with sparse
1128 transitions will not consume large amounts of mem. This is also in prep
1129 for fsm graph getting a default transition.
1130 -Generated code contains a statement explicitly stating that ragel fsms
1131 are NOT covered by the GPL. Technically, Ragel copies part of itself
1132 to the output to make the generic fsm execution routine (for table driven
1133 fsms only) and so the output could be considered under the GPL. But this
1134 code is very trivial and could easlily be rewritten. The actual fsm data
1135 is subject to the copyright of the source. To promote the use of Ragel,
1136 a special exception is made for the part of the output copied from Ragel:
1137 it may be used without restriction.
1138 -Much more elegant code generation scheme is employed. Code generation
1139 class members need only put the 'codegen' keyword after their 'void' type
1140 in order to be automatically registerd to handle macros of the same name.
1141 An awk script recognises this keyword and generates an appropriate driver.
1142 -Ragel gets a test suite.
1143 -Postfunc and prefunc go away because they are not supported by non
1144 loop-driven fsms (goto, switch) and present duplicate functionality.
1145 Universal funcs can be implemented by using $ operator.
1146 -Automatic dependencies used in build system, no more make depend target.
1147 -Code generation section in docs.
1148 -Uses the latests aapl.
1150 Ragel 1.0.5 - March 3, 2002
1151 ===========================
1152 -Bugfix in SetErrorState that caused an assertion failure when compiling
1153 simple machines that did not have full transition tables (and thus did
1154 not show up on any example machines). Assertion failure did not occur
1155 when using the switch statement code as ragel does not call SetErrorState
1157 -Fixed some missing includes, now compiles on redhat.
1158 -Moved the FsmMachTrans Compare class out of FsmMachTrans. Some compilers
1159 don't deal with nested classes in templates too well.
1160 -Removed old unused BASEREF in fsmgraph and ragel now compiles using
1161 egcs-2.91.66 and presumably SUNWspro. The baseref is no longer needed
1162 because states do not support being elements in multiple lists. I would
1163 rather be able to support more compilers than have this feature.
1164 -Started a README with compilation notes. Started an AUTHORS file.
1165 -Started the user documentation. Describes basic machines and operators.
1167 Ragel 1.0.4 - March 1, 2002
1168 ===========================
1169 -Ported to the version of Aapl just after 2.2.0 release. See
1170 http://www.ragel.ca/aapl/ for details on aapl.
1171 -Fixed a bug in the clang example: the newline machine was not stared.
1172 -Added explanations to the clang and mailbox examples. This should
1173 help people that want to learn the lanuage as the manual is far from
1176 Ragel 1.0.3 - Feb 2, 2002
1177 =========================
1178 -Added aapl to the ragel tree. No longer requires you to download
1179 and build aapl separately. Should avoid discouraging impatient users
1180 from compiling ragel.
1181 -Added the examples to the ragel tree.
1182 -Added configure script checks for bison and flex.
1183 -Fixed makefile so as not to die with newer versions of bison that
1184 write the header of the parser to a .hh file.
1185 -Started ChangeLog file.
1187 Ragel 1.0.2 - Jan 30, 2002
1188 ==========================
1189 -Bug fix in calculating highIndex for table based code. Was using
1190 the length of out tranisition table rather than the value at the
1192 -If high/low index are at the limits, output a define in their place,
1193 not the high/low values themselves so as not to cause compiler warnings.
1194 -If the resulting machines don't have any indicies or functions, then
1195 omit the empty unrefereced static arrays so as not to cause compiler
1196 warnings about unused static vars.
1197 -Fixed variable sized indicies support. The header cannot have any
1198 reference to INDEX_TYPE as that info is not known at the time the header
1199 data is written. Forces us to use a void * for pointers to indicies. In
1200 the c++ versions we are forced to make much of the data non-member
1201 static data in the code portion for the same reason.
1203 Ragel 1.0.1 - Jan 28, 2002
1204 ==========================
1205 -Exe name change from reglang to ragel.
1206 -Added ftabcodegen output code style which uses a table for states and
1207 transitions but uses a switch statement for the function execution.
1208 -Reformatted options in usage dump to look better.
1209 -Support escape sequences in [] sections of regular expressions.
1211 Ragel 1.0 - Jan 25, 2002
1212 ========================
projects / external / ragel.git / blob