X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/0078681b6bc2d90f74654f85f076fe224a990f07..23ce6f4cb35ec3b966d01f9236196665e58e3dd6:/ChangeLog diff --git a/ChangeLog b/ChangeLog index bd530d5b..2b31a12c 100644 --- a/ChangeLog +++ b/ChangeLog @@ -1,3 +1,88 @@ +2008-11-16 Akim Demaille + + Add missing $(EXEEXT). + * doc/local.mk ($(CROSS_OPTIONS_TEXI)): The target is + "src/bison$(EXEEXT)". + Reported by Di-an Jan. + +2008-11-15 Akim Demaille + + * TODO: Update. + +2008-11-15 Akim Demaille + + Formatting changes. + * tests/input.at: here. + +2008-11-15 Akim Demaille + + Remove duplicate header inclusion. + * src/LR0.c: here. + +2008-11-15 Akim Demaille + + * src/parse-gram.h, src/parse-gram.c: Regen. + +2008-11-15 Akim Demaille + + Support parametric types. + + There are two issues to handle: first scanning nested angle + bracket pairs to support types such as std::pair< std::string, + std::list > >. + + Another issue is to address idiosyncracies of C++: do not glue two + closing angle brackets together (otherwise it's operator>>), and + avoid sticking blindly a TYPE to the opening <, as it can result + in '<:' which is a digraph for '['. + + * src/scan-gram.l (brace_level): Rename as... + (nesting): this. + (SC_TAG): New. + Implement support for complex tags. + (tag): Accept + , but not <. + * data/lalr1.cc (b4_symbol_value, b4_symbol_value_template) + (b4_symbol_variant): Leave space around types as parameters. + * examples/variant.yy: Use nested template types and leading ::. + * src/parse-gram.y (TYPE, TYPE_TAG_ANY, TYPE_TAG_NONE, type.opt): + Rename as... + (TAG, TAG_ANY, TAG_NONE, tag.opt): these. + * tests/c++.at: Test parametric types. + +2008-11-15 Akim Demaille + + Test token.prefix. + This is not sufficient, but we test at least that the make_SYMBOL + interface is not affected by token.prefix. A more general test + will be implemented when the support of token.prefix is generalized + to more skeletons. + + * tests/c++.at: One more variant test, using token.prefix. + +2008-11-15 Akim Demaille + + Test the make_TOKEN interface. + * tests/c++.at (AT_CHECK_VARIANTS): Require and use locations. + Factor the common code in yylex. + Use it to test "%define lex_symbol". + +2008-11-15 Akim Demaille + + Formatting change. + +2008-11-15 Akim Demaille + + Simplify code for variants bench marks. + * etc/bench.pl.in (&generate_grammar_list): Define and use + location_type. + Factor the common code in yylex. + +2008-11-15 Akim Demaille + + Better error message. + * bootstrap (find_tool): Fix the error message. + 2008-11-15 Akim Demaille Update variant.yy to newest interface. @@ -48,10 +133,10 @@ 2008-11-15 Akim Demaille Move sc_tight_scope into maint.mk. - It does not work, and I don't know how it was supposed to work: it seems - to be looking for sources in the build tree. I just moved it at a better - place, fixing it is still required. - + It does not work, and I don't know how it was supposed to work: it + seems to be looking for sources in the build tree. I just moved + it at a better place, fixing it is still required. + * src/local.mk (echo): Remove. (sc_tight_scope): Move to... * maint.mk: here. @@ -137,7 +222,8 @@ 2008-11-15 Akim Demaille - Instead of using make_symbol, generate make_FOO for each token type. + Instead of using make_symbol, generate make_FOO for each + token type. Using template buys us nothing, and makes it uselessly complex to construct a symbol. Besides, it could not be generalized to other languages, while make_FOO would work in C/Java etc. @@ -160,10 +246,10 @@ 2008-11-13 Akim Demaille %define token.prefix. - Provide a means to add a prefix to the name of the tokens as output in the - generated files. Because of name clashes, it is good to have such a - prefix such as TOK_ that protects from names such as EOF, FILE etc. - But it clutters the grammar itself. + Provide a means to add a prefix to the name of the tokens as + output in the generated files. Because of name clashes, it is + good to have such a prefix such as TOK_ that protects from names + such as EOF, FILE etc. But it clutters the grammar itself. * data/bison.m4 (token.prefix): Empty by default. * data/c.m4 (b4_token_enum, b4_token_define): Use it. @@ -178,8 +264,7 @@ 2008-11-13 Akim Demaille symbol::token. - This is allows the user to get the type of a token return by - yylex. + This allows the user to get the type of a token returned by yylex. * data/lalr1.cc (symbol::token): New. (yytoknum_): Define when %define lex_symbol, independently of @@ -209,8 +294,9 @@ 2008-11-13 Akim Demaille Define make_symbol in the header. - To reach good performances these functions should be inlined (yet this is - to measure precisely). To this end they must be available to the caller. + To reach good performances these functions should be inlined (yet + this is to measure precisely). To this end they must be available + to the caller. * data/lalr1.cc (b4_symbol_constructor_definition_): Qualify location_type with the class name. @@ -228,13 +314,14 @@ 2008-11-13 Akim Demaille - Define the constructors of symbol_type in b4_symbol_constructor_definitions. + Define the constructors of symbol_type in + b4_symbol_constructor_definitions. The constructors are called by the make_symbol functions, which a - forthcoming patch will move elsewhere. Hence the interest of putting them - together. + forthcoming patch will move elsewhere. Hence the interest of + putting them together. - The stack_symbol_type does not need to be moved, it is used only by the - parser. + The stack_symbol_type does not need to be moved, it is used only + by the parser. * data/lalr1.cc: Move symbol_type and symbol_base_type constructors into... @@ -285,9 +372,9 @@ 2008-11-13 Akim Demaille Use b4_type_names for the union type. - The union used to compute the size of the variant used to iterate over the - type of all the symbols, with a lot of redundancy. Now iterate over the - lists of symbols having the same type-name. + The union used to compute the size of the variant used to iterate + over the type of all the symbols, with a lot of redundancy. Now + iterate over the lists of symbols having the same type-name. * data/lalr1.cc (b4_char_sizeof_): New. (b4_char_sizeof): Use it. @@ -298,12 +385,12 @@ 2008-11-13 Akim Demaille Define the "identifier" of a symbol. - Symbols may have several string representations, for instance if they - have an alias. What I call its "id" is a string that can be used as - an identifier. May not exist. + Symbols may have several string representations, for instance if + they have an alias. What I call its "id" is a string that can be + used as an identifier. May not exist. - Currently the symbols which have the "tag_is_id" flag set are those that - don't have an alias. Look harder for the id. + Currently the symbols which have the "tag_is_id" flag set are + those that don't have an alias. Look harder for the id. * src/output.c (is_identifier): Move to... * src/symtab.c (is_identifier): here. @@ -443,13 +530,13 @@ 2008-11-11 Akim Demaille Introduce make_symbol. - make_symbol provides a means to construct a full symbol (kind, value, - location) in a single shot. It is meant to be a Symbol constructor, - parameterized by the symbol kind so that overloading would prevent - incorrect kind/value pairs. Unfortunately parameterized constructors do - not work well in C++ (unless the parameter also appears as an argument, - which is not acceptable), hence the use of a function instead of a - constructor. + make_symbol provides a means to construct a full symbol (kind, + value, location) in a single shot. It is meant to be a Symbol + constructor, parameterized by the symbol kind so that overloading + would prevent incorrect kind/value pairs. Unfortunately + parameterized constructors do not work well in C++ (unless the + parameter also appears as an argument, which is not acceptable), + hence the use of a function instead of a constructor. * data/lalr1.cc (b4_symbol_constructor_declaration_) (b4_symbol_constructor_declarations) @@ -602,8 +689,8 @@ 2008-11-10 Akim Demaille Make parser::yytranslate static. - Small speedup (1%) on the list grammar. And makes yytranslate_ available - in non member functions. + Small speedup (1%) on the list grammar. And makes yytranslate_ + available in non member functions. * data/lalr1.cc (yytranslate_): Does not need to be a instance function. @@ -863,9 +950,10 @@ 2008-11-09 Akim Demaille Rely on the state stack to display reduction traces. - To display rhs symbols before a reduction, we used information about the rule - reduced, which required the tables yyrhs and yyprhs. Now use rely only on the - state stack to get the same information. + To display rhs symbols before a reduction, we used information + about the rule reduced, which required the tables yyrhs and + yyprhs. Now use rely only on the state stack to get the same + information. * data/lalr1.cc (b4_rhs_data, b4_rhs_state): New. Use them. @@ -1290,18 +1378,22 @@ 2008-11-03 Akim Demaille Fuse the three stacks into a single one. - In order to make it easy to perform benchmarks to ensure that there are no - performance loss, lalr1.cc is forked into lalr1-fusion.cc. Eventually, - lalr1-fusion.cc will replace lalr1.cc. - Meanwhile, to make sure that lalr1-fusion.cc is correctly exercized by the - test suite, the user must install a symbolic link from lalr1.cc to it. + In order to make it easy to perform benchmarks to ensure that + there are no performance loss, lalr1.cc is forked into + lalr1-fusion.cc. Eventually, lalr1-fusion.cc will replace + lalr1.cc. - Instead of having three stacks (state, value, location), use a stack - of triples. This considerably simplifies the code (and it will be - easier not to require locations as currently does the C++ parser), - and also gives a 10% speedup according to etc/bench (probably mainly since - memory allocation is done once instead of three times). + Meanwhile, to make sure that lalr1-fusion.cc is correctly + exercized by the test suite, the user must install a symbolic link + from lalr1.cc to it. + + Instead of having three stacks (state, value, location), use a + stack of triples. This considerably simplifies the code (and it + will be easier not to require locations as currently does the C++ + parser), and also gives a 10% speedup according to + etc/bench (probably mainly since memory allocation is done once + instead of three times). Another motivation is to make it easier to destruct properly semantic values: now that they are bound to their state (hence @@ -1309,8 +1401,8 @@ These changes should probably benefit the C parser too. - * data/lalr1.cc: Copy as... * data/lalr1-fusion.cc: this new - file. + * data/lalr1.cc: Copy as... + * data/lalr1-fusion.cc: this new file. (b4_rhs_value, b4_rhs_location): New definitions overriding those from c++.m4. (state_stack_type, semantic_stack_type, location_stack_type) @@ -1353,14 +1445,15 @@ 2008-11-03 Akim Demaille Use variants to support objects as semantic values. - This patch was inspired by work by Michiel De Wilde. But he used Boost - variants which (i) requires Boost on the user side, (ii) is slow, and - (iii) has useless overhead (the parser knows the type of the semantic value - there is no reason to duplicate this information as Boost.Variants do). - - This implementation reserves a buffer large enough to store the largest - objects. yy::variant implements this buffer. It was implemented with - Quentin Hocquet. + This patch was inspired by work by Michiel De Wilde. But he used + Boost variants which (i) requires Boost on the user side, (ii) is + slow, and (iii) has useless overhead (the parser knows the type of + the semantic value there is no reason to duplicate this + information as Boost.Variants do). + + This implementation reserves a buffer large enough to store the + largest objects. yy::variant implements this buffer. It was + implemented with Quentin Hocquet. * src/output.c (type_names_output): New. (output_skeleton): Invoke it.