In a two-association definition like this: association { Foo[0..n] foos = join ... Bar[0..n] bars = join ... } the join path for "bars" can be trivially computed by reversing the join path specified for "foos". The PDL compiler can be changed to support the following syntax: association { Foo[0..n] foos = join ... Bar[0..n] bars; } The join path for "bars" is omitted and the PDL compiler should compute it by reversing the join path specified for the "foos" attribute. This would reduce the likelyhood of programming errors by making it unnecessary for the programmer to perform this mechanical calculation manually.
stale