Abstract:Parse trees are an essential internal construct of the q language. They are a nested list – or collection – of functions and their arguments, which can be executed when desired and are expressed in th...Parse trees are an essential internal construct of the q language. They are a nested list – or collection – of functions and their arguments, which can be executed when desired and are expressed in the form of (func;arg1;arg2;.). Understanding parse trees is useful in becoming fluent with such expressions. Knowledge of parse trees is useful in appreciating the full elasticity of q and giving us access to its full repertoire. This chapter introduces parse trees and then focuses on the functional evaluation of q-SQL queries. There are two critical native operators which the authors need to know to be able to work with parse trees: eval and parse. Read-only evaluation is performed with the function reval which has the same signature as eval. The verb reval simulates the effect of launching q with option -b, when accessing the instance remotely and running eval.Read More
Publication Year: 2019
Publication Date: 2019-11-04
Language: en
Type: other
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot