4 commits

Author	SHA1	Message	Date
Carl Worth	5070a20cd1	Convert lexer to talloc and add xtalloc wrappers. ... The lexer was previously using strdup (expecting the parser to free), but is now more consistent, easier to use, and slightly more efficent by using talloc along with the parser. Also, we add xtalloc and xtalloc_strdup wrappers around talloc and talloc_strdup to put all of the out-of-memory-checking code in one place.	2010-05-12 12:47:29 -07:00
Carl Worth	33cc400714	Fix defines involving both literals and other defined macros. ... We now store a list of tokens in our hash-table rather than a single string. This lets us replace each macro in the value as necessary. This code adds a link dependency on talloc which does exactly what we want in terms of memory management for a parser. The 3 tests added in the previous commit now pass.	2010-05-12 12:25:34 -07:00
Carl Worth	0b27b5f051	Implment #define ... By using the recently-imported hash_table implementation.	2010-05-10 16:16:06 -07:00
Carl Worth	a1e32bcff0	Add some compiler warnings and corresponding fixes. ... Most of the current problems were (mostly) harmless things like missing declarations, but there was at least one real error, (reversed argument order for yyerrror).	2010-05-10 13:32:29 -07:00