97d2813666
- Split up the `last` predicate into a non-recursive part `lastNonRec` and a recursive part `last`. - Almost all syntactic constructs have a very simple `last` definition; a set of disjuncts with exactly one recursive call -- those are defined in `lastNonRec`. - `try` statements and (last) `catch` clauses require multiple recursive calls in the same disjunct, and are therefore handled in the `last` predicate (as before). - The benefit is that we only need to take care of the join order in the recursive call (for non-`try`/`catch` statements) in one place (the predicate `lastRec`), so we can get rid of many `nomagic`'ed `last`-specialisations.
Semmle QL
This open source repository contains the standard QL libraries and queries that power LGTM, and the other products that Semmle makes available to its customers worldwide.
How do I learn QL and run queries?
There is extensive documentation on getting started with writing QL. You can use the interactive query console on LGTM.com or the QL for Eclipse plugin to try out your queries on any open-source project that's currently being analyzed.
Contributing
We welcome contributions to our standard library and standard checks. Do you have an idea for a new check, or how to improve an existing query? Then please go ahead and open a pull request! Before you do, though, please take the time to read our contributing guidelines. You can also consult our style guides to learn how to format your QL for consistency and clarity, how to write query metadata, and how to write query help documentation for your query.
License
The QL queries in this repository are licensed under Apache License 2.0 by Semmle.