J, 4946 bytes
;:@'AND NAND OR NOR XOR XNOR'#~*`*XNOR'#~*,*:`+,+.`+:`~,+:`=`,~:0,=
-2 bytest5 bytes thanks to Bubbler
I have been waiting 3 years to use Evoke Gerund in a challenge, and the day of reckoning has finally arrived!
Explanation:
We execute each of the gerundsa train *`**,*:`+,+.`+,+:`~,~:`=,= corresponding to the gates on the arguments, which will produce a single boolean mask of the results.
We then apply that mask as a filter #~ on the list of words, which is in the same order.
Note: Since the returned strings of are of unequal length, J requires them to be boxed.
J, 49 bytes
;:@'AND NAND OR NOR XOR XNOR'#~*`*:`+.`+:`~:`=`:0
-2 bytest thanks to Bubbler
I have been waiting 3 years to use Evoke Gerund in a challenge, and the day of reckoning has finally arrived!
Explanation:
We execute each of the gerunds *`*:`+.`+:`~:`= corresponding to the gates on the arguments, which will produce a single boolean mask of the results.
We then apply that mask as a filter #~ on the list of words, which is in the same order.
Note: Since the returned strings of are of unequal length, J requires them to be boxed.
J, 46 bytes
;:@'AND NAND OR NOR XOR XNOR'#~*,*:,+.,+:,~:,=
-5 bytes thanks to Bubbler
We execute a train *,*:,+.,+:,~:,= corresponding to the gates on the arguments, which will produce a single boolean mask of the results.
We then apply that mask as a filter #~ on the list of words, which is in the same order.
Note: Since the returned strings of are of unequal length, J requires them to be boxed.
J, 5149 bytes
;:@'AND NAND OR NOR XOR XNOR'#~(*`*XNOR'#~*`*:`+.`+:`~:`=)``=`:0
-2 bytest thanks to Bubbler
I have been waiting 3 years to use Evoke Gerund in a challenge, and the day of reckoning has finally arrived!
Explanation:
We execute each of the gerunds *`*:`+.`+:`~:`= corresponding to the gates on the arguments, which will produce a single boolean mask of the results.
We then apply that mask as a filter #~ on the list of words, which is in the same order.
Note: Since the returned strings of are of unequal length, J requires them to be boxed.
J, 51 bytes
;:@'AND NAND OR NOR XOR XNOR'#~(*`*:`+.`+:`~:`=)`:0
I have been waiting 3 years to use Evoke Gerund in a challenge, and the day of reckoning has finally arrived!
Explanation:
We execute each of the gerunds *`*:`+.`+:`~:`= corresponding to the gates on the arguments, which will produce a single boolean mask of the results.
We then apply that mask as a filter #~ on the list of words, which is in the same order.
Note: Since the returned strings of are of unequal length, J requires them to be boxed.
J, 49 bytes
;:@'AND NAND OR NOR XOR XNOR'#~*`*:`+.`+:`~:`=`:0
-2 bytest thanks to Bubbler
I have been waiting 3 years to use Evoke Gerund in a challenge, and the day of reckoning has finally arrived!
Explanation:
We execute each of the gerunds *`*:`+.`+:`~:`= corresponding to the gates on the arguments, which will produce a single boolean mask of the results.
We then apply that mask as a filter #~ on the list of words, which is in the same order.
Note: Since the returned strings of are of unequal length, J requires them to be boxed.
J, 51 bytes
;:@'AND NAND OR NOR XOR XNOR'#~(*`*:`+.`+:`~:`=)`:0
I have been waiting 3 years to use Evoke Gerund in a challenge, and the day of reckoning has finally arrived!
Explanation:
We execute each of the gerunds *`*:`+.`+:`~:`= corresponding to the gates on the arguments, which will produce a single boolean mask of the results.
We then apply that mask as a filter #~ on the list of words, which is in the same order.
Note: Since the returned strings of are of unequal length, J requires them to be boxed.
J, 51 bytes
;:@'AND NAND OR NOR XOR XNOR'#~(*`*:`+.`+:`~:`=)`:0
I have been waiting 3 years to use Evoke Gerund in a challenge, and the day of reckoning has finally arrived!
Note: Since the returned strings of are of unequal length, J requires them to be boxed.
J, 51 bytes
;:@'AND NAND OR NOR XOR XNOR'#~(*`*:`+.`+:`~:`=)`:0
I have been waiting 3 years to use Evoke Gerund in a challenge, and the day of reckoning has finally arrived!
Explanation:
We execute each of the gerunds *`*:`+.`+:`~:`= corresponding to the gates on the arguments, which will produce a single boolean mask of the results.
We then apply that mask as a filter #~ on the list of words, which is in the same order.
Note: Since the returned strings of are of unequal length, J requires them to be boxed.