nix-super/src/libexpr/Makefile.am

noinst_LIBRARIES = libexpr.a

libexpr_a_SOURCES = nixexpr.cc nixexpr.hh parser.cc parser.hh \
 eval.cc eval.hh primops.cc \
 lexer-tab.c lexer-tab.h parser-tab.c parser-tab.h \
 constructors.hh

EXTRA_DIST = lexer.l parser.y constructors.cc aterm-helper.pl

AM_CXXFLAGS = \
 -I.. ${bdb_include} ${aterm_include} -I../libutil -I../libstore
AM_CFLAGS = \
 ${aterm_include}


# Parser generation.

parser.o: parser-tab.h lexer-tab.h

parser-tab.c parser-tab.h: parser.y
	$(bison) -v -o parser-tab.c parser.y -d

lexer-tab.c lexer-tab.h: lexer.l
	$(flex) --outfile lexer-tab.c --header-file=lexer-tab.h lexer.l 


# ATerm helper function generation.

constructors.cc constructors.hh: aterm-helper.pl constructors.def
	$(perl) aterm-helper.pl constructors.hh constructors.cc < constructors.def

nixexpr.hh: constructors.hh


CLEANFILES =
* Refactoring (step 2). 2003-11-19 14:03:01 +02:00			`noinst_LIBRARIES = libexpr.a`
* Forked new version of Fix. 2003-10-29 17:05:18 +02:00
* More `make dist' fixes. 2003-11-25 15:01:21 +02:00			`libexpr_a_SOURCES = nixexpr.cc nixexpr.hh parser.cc parser.hh \`
* Allow primops with more that 1 arguments. 2004-08-04 13:59:20 +03:00			`eval.cc eval.hh primops.cc \`
* Don't use ATmake / ATmatch anymore, nor the ATMatcher class. Instead we generate data bindings (build and match functions) for the constructors specified in `constructors.def'. In particular this removes the conversions between AFuns and strings, and Nix expression evaluation now seems 3 to 4 times faster. 2004-10-27 01:54:26 +03:00			`lexer-tab.c lexer-tab.h parser-tab.c parser-tab.h \`
			`constructors.hh`
* Doh! 2004-01-30 19:14:08 +02:00
* Add file to `make dist'. 2004-10-27 03:02:31 +03:00			`EXTRA_DIST = lexer.l parser.y constructors.cc aterm-helper.pl`
* Forked new version of Fix. 2003-10-29 17:05:18 +02:00
			`AM_CXXFLAGS = \`
* Allow linking against an external Berkeley DB / ATerm library. 2004-02-16 18:37:16 +02:00			`-I.. ${bdb_include} ${aterm_include} -I../libutil -I../libstore`
* Replaced the SDF parser by a substantially faster Bison/Flex parser (roughly 80x faster). The absolutely latest version of Bison (1.875c) is required for reentrant GLR support, as well as a recent version of Flex (say, 2.5.31). Note that most Unix distributions ship with the prehistoric Flex 2.5.4, which doesn't support reentrancy. 2004-01-30 17:21:42 +02:00			`AM_CFLAGS = \`
* Allow linking against an external Berkeley DB / ATerm library. 2004-02-16 18:37:16 +02:00			`${aterm_include}`
* Basic grammar and parser for the Fix language. We use libsglr and friends to do the parsing. The parse table is embedded in the Fix executable using bin2c, which converts an arbitrary file into a C character array. 2003-10-29 18:05:03 +02:00

* Replaced the SDF parser by a substantially faster Bison/Flex parser (roughly 80x faster). The absolutely latest version of Bison (1.875c) is required for reentrant GLR support, as well as a recent version of Flex (say, 2.5.31). Note that most Unix distributions ship with the prehistoric Flex 2.5.4, which doesn't support reentrancy. 2004-01-30 17:21:42 +02:00			`# Parser generation.`
* Basic grammar and parser for the Fix language. We use libsglr and friends to do the parsing. The parse table is embedded in the Fix executable using bin2c, which converts an arbitrary file into a C character array. 2003-10-29 18:05:03 +02:00
* Detect flex and bison; updated the manual. 2004-01-30 18:32:14 +02:00			`parser.o: parser-tab.h lexer-tab.h`

* Replaced the SDF parser by a substantially faster Bison/Flex parser (roughly 80x faster). The absolutely latest version of Bison (1.875c) is required for reentrant GLR support, as well as a recent version of Flex (say, 2.5.31). Note that most Unix distributions ship with the prehistoric Flex 2.5.4, which doesn't support reentrancy. 2004-01-30 17:21:42 +02:00			`parser-tab.c parser-tab.h: parser.y`
* Detect flex and bison; updated the manual. 2004-01-30 18:32:14 +02:00			`$(bison) -v -o parser-tab.c parser.y -d`
* Basic grammar and parser for the Fix language. We use libsglr and friends to do the parsing. The parse table is embedded in the Fix executable using bin2c, which converts an arbitrary file into a C character array. 2003-10-29 18:05:03 +02:00
* Replaced the SDF parser by a substantially faster Bison/Flex parser (roughly 80x faster). The absolutely latest version of Bison (1.875c) is required for reentrant GLR support, as well as a recent version of Flex (say, 2.5.31). Note that most Unix distributions ship with the prehistoric Flex 2.5.4, which doesn't support reentrancy. 2004-01-30 17:21:42 +02:00			`lexer-tab.c lexer-tab.h: lexer.l`
* Detect flex and bison; updated the manual. 2004-01-30 18:32:14 +02:00			`$(flex) --outfile lexer-tab.c --header-file=lexer-tab.h lexer.l`
* Basic grammar and parser for the Fix language. We use libsglr and friends to do the parsing. The parse table is embedded in the Fix executable using bin2c, which converts an arbitrary file into a C character array. 2003-10-29 18:05:03 +02:00

* Don't use ATmake / ATmatch anymore, nor the ATMatcher class. Instead we generate data bindings (build and match functions) for the constructors specified in `constructors.def'. In particular this removes the conversions between AFuns and strings, and Nix expression evaluation now seems 3 to 4 times faster. 2004-10-27 01:54:26 +03:00			`# ATerm helper function generation.`

			`constructors.cc constructors.hh: aterm-helper.pl constructors.def`
			`$(perl) aterm-helper.pl constructors.hh constructors.cc < constructors.def`

			`nixexpr.hh: constructors.hh`


* Replaced the SDF parser by a substantially faster Bison/Flex parser (roughly 80x faster). The absolutely latest version of Bison (1.875c) is required for reentrant GLR support, as well as a recent version of Flex (say, 2.5.31). Note that most Unix distributions ship with the prehistoric Flex 2.5.4, which doesn't support reentrancy. 2004-01-30 17:21:42 +02:00			`CLEANFILES =`