├── .gitignore ├── LICENSE ├── README.md ├── pom.xml └── src ├── main └── java │ └── com │ └── orangecyberdefense │ └── sqltrees │ ├── AST.java │ ├── CompiledStatement.java │ ├── CompiledStatementError.java │ ├── OperatorAST.java │ ├── ReservedWords.java │ ├── SQLDSL.java │ └── StrLit.java └── test └── java └── com └── orangecyberdefense └── sqltrees ├── CompiledStatementTest.java ├── CriterionTest.java ├── Search.java └── SecureCriterionTest.java /.gitignore: -------------------------------------------------------------------------------- 1 | # editor backup files 2 | *~ 3 | 4 | # Compiled class file 5 | *.class 6 | # maven products 7 | target/ 8 | 9 | # Log file 10 | *.log 11 | 12 | # BlueJ files 13 | *.ctxt 14 | 15 | # Mobile Tools for Java (J2ME) 16 | .mtj.tmp/ 17 | 18 | # Package Files # 19 | *.jar 20 | *.war 21 | *.nar 22 | *.ear 23 | *.zip 24 | *.tar.gz 25 | *.rar 26 | 27 | # virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml 28 | hs_err_pid* 29 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # sqltrees 2 | A secure, developper-proof, Java library for querying SQL databases. 3 | 4 | This code is published under the GNU GPL (see LICENSE), with the 5 | exception of 6 | `src/main/java/com/orangecyberdefense/sqltrees/ReservedWords.java`, 7 | which is published under the Creative Commmons ShareALike License. 8 | -------------------------------------------------------------------------------- /pom.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 5 | 4.0.0 6 | 7 | com.orangecyberdefense.sqltrees 8 | sqltrees 9 | 1.0-SNAPSHOT 10 | 11 | sqltrees 12 | 13 | http://www.example.com 14 | 15 | 16 | UTF-8 17 | 1.7 18 | 1.7 19 | 20 | 21 | 22 | 23 | junit 24 | junit 25 | 4.13.1 26 | test 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | maven-clean-plugin 36 | 3.1.0 37 | 38 | 39 | 40 | maven-resources-plugin 41 | 3.0.2 42 | 43 | 44 | maven-compiler-plugin 45 | 3.8.0 46 | 47 | 48 | -Xlint:all 49 | 50 | 51 | 52 | 53 | maven-surefire-plugin 54 | 2.22.1 55 | 56 | 57 | maven-jar-plugin 58 | 3.0.2 59 | 60 | 61 | maven-install-plugin 62 | 2.5.2 63 | 64 | 65 | maven-deploy-plugin 66 | 2.8.2 67 | 68 | 69 | 70 | maven-site-plugin 71 | 3.7.1 72 | 73 | 74 | maven-project-info-reports-plugin 75 | 3.0.0 76 | 77 | 78 | 79 | 80 | 81 | -------------------------------------------------------------------------------- /src/main/java/com/orangecyberdefense/sqltrees/AST.java: -------------------------------------------------------------------------------- 1 | package com.orangecyberdefense.sqltrees; 2 | 3 | import java.util.Arrays; 4 | import java.sql.Connection; 5 | import java.sql.ResultSet; 6 | 7 | public class AST { 8 | protected String lp = "("; 9 | protected String rp = ")"; 10 | protected final String label; 11 | protected final int parenLevel; 12 | 13 | private final AST[] children; 14 | 15 | // Constructors 16 | AST(String label, AST[] a, int plevel) { 17 | this.parenLevel = plevel; 18 | this.label = label; 19 | this.children = (a == null) ? new AST[0] : a; 20 | } 21 | 22 | // Accessors 23 | public int getChildrenCount() { 24 | return this.children.length; 25 | } 26 | 27 | public AST getChild(int i) { 28 | return this.children[i]; 29 | } 30 | 31 | void writeTo(CompiledStatement b) { 32 | b.addToken(this.label); 33 | int n = getChildrenCount(); 34 | for (int i = 0; i < n; i++) { 35 | getChild(i).cpwriteTo(b, parenLevel); 36 | } 37 | } 38 | 39 | // parenthesis-surrounded write 40 | void pwriteTo(CompiledStatement b) { 41 | b.addToken(this.lp); writeTo(b); b.addToken(this.rp); 42 | } 43 | 44 | // conditional parenthesis-surrounded write 45 | // p is the precedence of the surrounding operator 46 | void cpwriteTo(CompiledStatement b, int p) { 47 | // if we bind tighter (lower precedence level) than the 48 | // surrounding operator, there is no need to parenthesize 49 | if (parenLevel < p) { writeTo(b); } else { pwriteTo(b); } 50 | } 51 | 52 | public CompiledStatement compile() { 53 | CompiledStatement b = new CompiledStatement(); 54 | writeTo(b); 55 | return b; 56 | } 57 | 58 | public ResultSet execute(Connection con) throws CompiledStatementError { 59 | return compile().run(con); 60 | } 61 | 62 | } 63 | -------------------------------------------------------------------------------- /src/main/java/com/orangecyberdefense/sqltrees/CompiledStatement.java: -------------------------------------------------------------------------------- 1 | package com.orangecyberdefense.sqltrees; 2 | 3 | import java.util.ArrayList; 4 | import java.sql.Connection; 5 | import java.sql.PreparedStatement; 6 | import java.sql.ResultSet; 7 | import java.sql.SQLException; 8 | 9 | public final class CompiledStatement { 10 | private final StringBuffer tpl = new StringBuffer(); 11 | private final ArrayList args = new ArrayList(); 12 | 13 | public String getTpl() { 14 | return tpl.toString(); 15 | } 16 | 17 | public String[] getArgs() { 18 | return args.toArray(new String[0]); 19 | } 20 | 21 | void addStringParam(String s) { 22 | tpl.append("? "); 23 | args.add(s); 24 | } 25 | 26 | void addToken(String repr) { 27 | tpl.append(repr); 28 | tpl.append(" "); 29 | } 30 | 31 | PreparedStatement getPreparedStatement(Connection con) 32 | throws SQLException { 33 | PreparedStatement stmt = con.prepareStatement(tpl.toString()); 34 | for(int i = 0; i < args.size(); i++) { 35 | stmt.setString(i+1, // numbering starts at 1 36 | args.get(i)); 37 | } 38 | return stmt; 39 | } 40 | 41 | public ResultSet run(Connection con) throws CompiledStatementError { 42 | try { 43 | return getPreparedStatement(con).executeQuery(); 44 | } catch (SQLException e) { 45 | throw new CompiledStatementError(); 46 | } 47 | } 48 | } 49 | -------------------------------------------------------------------------------- /src/main/java/com/orangecyberdefense/sqltrees/CompiledStatementError.java: -------------------------------------------------------------------------------- 1 | package com.orangecyberdefense.sqltrees; 2 | 3 | public class CompiledStatementError extends Exception { 4 | // Exception raised in case of an error when executing a CompiledStatement 5 | } 6 | -------------------------------------------------------------------------------- /src/main/java/com/orangecyberdefense/sqltrees/OperatorAST.java: -------------------------------------------------------------------------------- 1 | package com.orangecyberdefense.sqltrees; 2 | 3 | class OperatorAST extends AST { 4 | protected final AST neutral; 5 | 6 | OperatorAST(String s, AST[] exprs, int plevel, AST neutral) { 7 | super(s, exprs, plevel); 8 | this.neutral = neutral; 9 | } 10 | 11 | void writeTo(CompiledStatement b) { 12 | int n = getChildrenCount(); 13 | if (n == 0) { 14 | this.neutral.writeTo(b); 15 | } else { 16 | getChild(0).cpwriteTo(b, parenLevel); 17 | for (int i = 1; i < n; i++) { 18 | b.addToken(this.label); 19 | getChild(i).cpwriteTo(b, parenLevel); 20 | } 21 | } 22 | } 23 | } 24 | -------------------------------------------------------------------------------- /src/main/java/com/orangecyberdefense/sqltrees/ReservedWords.java: -------------------------------------------------------------------------------- 1 | package com.orangecyberdefense.sqltrees; 2 | 3 | import java.util.Arrays; 4 | 5 | final class ReservedWords { 6 | ReservedWords() { 7 | // make sure we can binarySearch the array 8 | Arrays.sort(reserved); 9 | } 10 | boolean isReservedWord(String s) { 11 | return Arrays.binarySearch(reserved, s.toUpperCase()) >= 0; 12 | } 13 | 14 | static ReservedWords singleton = new ReservedWords(); 15 | 16 | public static boolean isReserved(String s) { 17 | return singleton.isReservedWord(s); 18 | } 19 | // List of reserved words, taken from 20 | // https://en.wikipedia.org/wiki/SQL_reserved_words, 2020-06-30. 21 | // This list is distributed under Creative Commons Attribution-ShareAlike License 22 | private String[] reserved = { 23 | "ABORT", 24 | "ABORTSESSION", 25 | "ABS", 26 | "ABSOLUTE", 27 | "ACCESS", 28 | "ACCESSIBLE", 29 | "ACCESS_LOCK", 30 | "ACCOUNT", 31 | "ACOS", 32 | "ACOSH", 33 | "ACTION", 34 | "ADD", 35 | "ADD_MONTHS", 36 | "ADMIN", 37 | "AFTER", 38 | "AGGREGATE", 39 | "ALIAS", 40 | "ALL", 41 | "ALLOCATE", 42 | "ALLOW", 43 | "ALTER", 44 | "ALTERAND", 45 | "AMP", 46 | "ANALYSE", 47 | "ANALYZE", 48 | "AND", 49 | "ANSIDATE", 50 | "ANY", 51 | "ARE", 52 | "ARRAY", 53 | "ARRAY_AGG", 54 | "ARRAY_EXISTS", 55 | "ARRAY_MAX_CARDINALITY", 56 | "AS", 57 | "ASC", 58 | "ASENSITIVE", 59 | "ASIN", 60 | "ASINH", 61 | "ASSERTION", 62 | "ASSOCIATE", 63 | "ASUTIME", 64 | "ASYMMETRIC", 65 | "AT", 66 | "ATAN", 67 | "ATAN2", 68 | "ATANH", 69 | "ATOMIC", 70 | "AUDIT", 71 | "AUTHORIZATION", 72 | "AUX", 73 | "AUXILIARY", 74 | "AVE", 75 | "AVERAGE", 76 | "AVG", 77 | "BACKUP", 78 | "BEFORE", 79 | "BEGIN", 80 | "BEGIN_FRAME", 81 | "BEGIN_PARTITION", 82 | "BETWEEN", 83 | "BIGINT", 84 | "BINARY", 85 | "BIT", 86 | "BLOB", 87 | "BOOLEAN", 88 | "BOTH", 89 | "BREADTH", 90 | "BREAK", 91 | "BROWSE", 92 | "BT", 93 | "BUFFERPOOL", 94 | "BULK", 95 | "BUT", 96 | "BY", 97 | "BYTE", 98 | "BYTEINT", 99 | "BYTES", 100 | "CALL", 101 | "CALLED", 102 | "CAPTURE", 103 | "CARDINALITY", 104 | "CASCADE", 105 | "CASCADED", 106 | "CASE", 107 | "CASESPECIFIC", 108 | "CASE_N", 109 | "CAST", 110 | "CATALOG", 111 | "CCSID", 112 | "CD", 113 | "CEIL", 114 | "CEILING", 115 | "CHANGE", 116 | "CHAR", 117 | "CHAR2HEXINT", 118 | "CHARACTER", 119 | "CHARACTERS", 120 | "CHARACTER_LENGTH", 121 | "CHARS", 122 | "CHAR_LENGTH", 123 | "CHECK", 124 | "CHECKPOINT", 125 | "CLASS", 126 | "CLASSIFIER", 127 | "CLOB", 128 | "CLONE", 129 | "CLOSE", 130 | "CLUSTER", 131 | "CLUSTERED", 132 | "CM", 133 | "COALESCE", 134 | "COLLATE", 135 | "COLLATION", 136 | "COLLECT", 137 | "COLLECTION", 138 | "COLLID", 139 | "COLUMN", 140 | "COLUMN_VALUE", 141 | "COMMENT", 142 | "COMMIT", 143 | "COMPLETION", 144 | "COMPRESS", 145 | "COMPUTE", 146 | "CONCAT", 147 | "CONCURRENTLY", 148 | "CONDITION", 149 | "CONNECT", 150 | "CONNECTION", 151 | "CONSTRAINT", 152 | "CONSTRAINTS", 153 | "CONSTRUCTOR", 154 | "CONTAINS", 155 | "CONTAINSTABLE", 156 | "CONTENT", 157 | "CONTINUE", 158 | "CONVERT", 159 | "CONVERT_TABLE_HEADER", 160 | "COPY", 161 | "CORR", 162 | "CORRESPONDING", 163 | "COS", 164 | "COSH", 165 | "COUNT", 166 | "COVAR_POP", 167 | "COVAR_SAMP", 168 | "CREATE", 169 | "CROSS", 170 | "CS", 171 | "CSUM", 172 | "CT", 173 | "CUBE", 174 | "CUME_DIST", 175 | "CURRENT", 176 | "CURRENT_CATALOG", 177 | "CURRENT_DATE", 178 | "CURRENT_DEFAULT_TRANSFORM_GROUP", 179 | "CURRENT_LC_CTYPE", 180 | "CURRENT_PATH", 181 | "CURRENT_ROLE", 182 | "CURRENT_ROW", 183 | "CURRENT_SCHEMA", 184 | "CURRENT_TIME", 185 | "CURRENT_TIMESTAMP", 186 | "CURRENT_TRANSFORM_GROUP_FOR_TYPE", 187 | "CURRENT_USER", 188 | "CURRVAL", 189 | "CURSOR", 190 | "CV", 191 | "CYCLE", 192 | "DATA", 193 | "DATABASE", 194 | "DATABASES", 195 | "DATABLOCKSIZE", 196 | "DATE", 197 | "DATEFORM", 198 | "DAY", 199 | "DAYS", 200 | "DAY_HOUR", 201 | "DAY_MICROSECOND", 202 | "DAY_MINUTE", 203 | "DAY_SECOND", 204 | "DBCC", 205 | "DBINFO", 206 | "DEALLOCATE", 207 | "DEC", 208 | "DECFLOAT", 209 | "DECIMAL", 210 | "DECLARE", 211 | "DEFAULT", 212 | "DEFERRABLE", 213 | "DEFERRED", 214 | "DEFINE", 215 | "DEGREES", 216 | "DEL", 217 | "DELAYED", 218 | "DELETE", 219 | "DENSE_RANK", 220 | "DENY", 221 | "DEPTH", 222 | "DEREF", 223 | "DESC", 224 | "DESCRIBE", 225 | "DESCRIPTOR", 226 | "DESTROY", 227 | "DESTRUCTOR", 228 | "DETERMINISTIC", 229 | "DIAGNOSTIC", 230 | "DIAGNOSTICS", 231 | "DICTIONARY", 232 | "DISABLE", 233 | "DISABLED", 234 | "DISALLOW", 235 | "DISCONNECT", 236 | "DISK", 237 | "DISTINCT", 238 | "DISTINCTROW", 239 | "DISTRIBUTED", 240 | "DIV", 241 | "DO", 242 | "DOCUMENT", 243 | "DOMAIN", 244 | "DOUBLE", 245 | "DROP", 246 | "DSSIZE", 247 | "DUAL", 248 | "DUMP", 249 | "DYNAMIC", 250 | "EACH", 251 | "ECHO", 252 | "EDITPROC", 253 | "ELEMENT", 254 | "ELSE", 255 | "ELSEIF", 256 | "EMPTY", 257 | "ENABLED", 258 | "ENCLOSED", 259 | "ENCODING", 260 | "ENCRYPTION", 261 | "END", 262 | "END-EXEC", 263 | "ENDING", 264 | "END_FRAME", 265 | "END_PARTITION", 266 | "EQ", 267 | "EQUALS", 268 | "ERASE", 269 | "ERRLVL", 270 | "ERROR", 271 | "ERRORFILES", 272 | "ERRORTABLES", 273 | "ESCAPE", 274 | "ESCAPED", 275 | "ET", 276 | "EVERY", 277 | "EXCEPT", 278 | "EXCEPTION", 279 | "EXCLUSIVE", 280 | "EXEC", 281 | "EXECUTE", 282 | "EXISTS", 283 | "EXIT", 284 | "EXP", 285 | "EXPLAIN", 286 | "EXTERNAL", 287 | "EXTRACT", 288 | "FALLBACK", 289 | "FALSE", 290 | "FASTEXPORT", 291 | "FENCED", 292 | "FETCH", 293 | "FIELDPROC", 294 | "FILE", 295 | "FILLFACTOR", 296 | "FILTER", 297 | "FINAL", 298 | "FIRST", 299 | "FIRST_VALUE", 300 | "FLOAT", 301 | "FLOAT4", 302 | "FLOAT8", 303 | "FLOOR", 304 | "FOR", 305 | "FORCE", 306 | "FOREIGN", 307 | "FORMAT", 308 | "FOUND", 309 | "FRAME_ROW", 310 | "FREE", 311 | "FREESPACE", 312 | "FREETEXT", 313 | "FREETEXTTABLE", 314 | "FREEZE", 315 | "FROM", 316 | "FULL", 317 | "FULLTEXT", 318 | "FUNCTION", 319 | "FUSION", 320 | "GE", 321 | "GENERAL", 322 | "GENERATED", 323 | "GET", 324 | "GIVE", 325 | "GLOBAL", 326 | "GO", 327 | "GOTO", 328 | "GRANT", 329 | "GRAPHIC", 330 | "GROUP", 331 | "GROUPING", 332 | "GROUPS", 333 | "GT", 334 | "HANDLER", 335 | "HASH", 336 | "HASHAMP", 337 | "HASHBAKAMP", 338 | "HASHBUCKET", 339 | "HASHROW", 340 | "HAVING", 341 | "HELP", 342 | "HIGH_PRIORITY", 343 | "HOLD", 344 | "HOLDLOCK", 345 | "HOST", 346 | "HOUR", 347 | "HOURS", 348 | "HOUR_MICROSECOND", 349 | "HOUR_MINUTE", 350 | "HOUR_SECOND", 351 | "IDENTIFIED", 352 | "IDENTITY", 353 | "IDENTITYCOL", 354 | "IDENTITY_INSERT", 355 | "IF", 356 | "IGNORE", 357 | "ILIKE", 358 | "IMMEDIATE", 359 | "IN", 360 | "INCLUSIVE", 361 | "INCONSISTENT", 362 | "INCREMENT", 363 | "INDEX", 364 | "INDICATOR", 365 | "INFILE", 366 | "INHERIT", 367 | "INITIAL", 368 | "INITIALIZE", 369 | "INITIALLY", 370 | "INITIATE", 371 | "INNER", 372 | "INOUT", 373 | "INPUT", 374 | "INS", 375 | "INSENSITIVE", 376 | "INSERT", 377 | "INSTEAD", 378 | "INT", 379 | "INT1", 380 | "INT2", 381 | "INT3", 382 | "INT4", 383 | "INT8", 384 | "INTEGER", 385 | "INTEGERDATE", 386 | "INTERSECT", 387 | "INTERSECTION", 388 | "INTERVAL", 389 | "INTO", 390 | "IO_AFTER_GTIDS", 391 | "IO_BEFORE_GTIDS", 392 | "IS", 393 | "ISNULL", 394 | "ISOBID", 395 | "ISOLATION", 396 | "ITERATE", 397 | "JAR", 398 | "JOIN", 399 | "JOURNAL", 400 | "JSON_ARRAY", 401 | "JSON_ARRAYAGG", 402 | "JSON_EXISTS", 403 | "JSON_OBJECT", 404 | "JSON_OBJECTAGG", 405 | "JSON_QUERY", 406 | "JSON_TABLE", 407 | "JSON_TABLE_PRIMITIVE", 408 | "JSON_VALUE", 409 | "KEEP", 410 | "KEY", 411 | "KEYS", 412 | "KILL", 413 | "KURTOSIS", 414 | "LABEL", 415 | "LAG", 416 | "LANGUAGE", 417 | "LARGE", 418 | "LAST", 419 | "LAST_VALUE", 420 | "LATERAL", 421 | "LC_CTYPE", 422 | "LE", 423 | "LEAD", 424 | "LEADING", 425 | "LEAVE", 426 | "LEFT", 427 | "LESS", 428 | "LEVEL", 429 | "LIKE", 430 | "LIKE_REGEX", 431 | "LIMIT", 432 | "LINEAR", 433 | "LINENO", 434 | "LINES", 435 | "LISTAGG", 436 | "LN", 437 | "LOAD", 438 | "LOADING", 439 | "LOCAL", 440 | "LOCALE", 441 | "LOCALTIME", 442 | "LOCALTIMESTAMP", 443 | "LOCATOR", 444 | "LOCATORS", 445 | "LOCK", 446 | "LOCKING", 447 | "LOCKMAX", 448 | "LOCKSIZE", 449 | "LOG", 450 | "LOG10", 451 | "LOGGING", 452 | "LOGON", 453 | "LONG", 454 | "LONGBLOB", 455 | "LONGTEXT", 456 | "LOOP", 457 | "LOWER", 458 | "LOW_PRIORITY", 459 | "LT", 460 | "MACRO", 461 | "MAINTAINED", 462 | "MAP", 463 | "MASTER_BIND", 464 | "MASTER_SSL_VERIFY_SERVER_CERT", 465 | "MATCH", 466 | "MATCHES", 467 | "MATCH_NUMBER", 468 | "MATCH_RECOGNIZE", 469 | "MATERIALIZED", 470 | "MAVG", 471 | "MAX", 472 | "MAXEXTENTS", 473 | "MAXIMUM", 474 | "MAXVALUE", 475 | "MCHARACTERS", 476 | "MDIFF", 477 | "MEDIUMBLOB", 478 | "MEDIUMINT", 479 | "MEDIUMTEXT", 480 | "MEMBER", 481 | "MERGE", 482 | "METHOD", 483 | "MICROSECOND", 484 | "MICROSECONDS", 485 | "MIDDLEINT", 486 | "MIN", 487 | "MINDEX", 488 | "MINIMUM", 489 | "MINUS", 490 | "MINUTE", 491 | "MINUTES", 492 | "MINUTE_MICROSECOND", 493 | "MINUTE_SECOND", 494 | "MLINREG", 495 | "MLOAD", 496 | "MLSLABEL", 497 | "MOD", 498 | "MODE", 499 | "MODIFIES", 500 | "MODIFY", 501 | "MODULE", 502 | "MONITOR", 503 | "MONRESOURCE", 504 | "MONSESSION", 505 | "MONTH", 506 | "MONTHS", 507 | "MSUBSTR", 508 | "MSUM", 509 | "MULTISET", 510 | "NAMED", 511 | "NAMES", 512 | "NATIONAL", 513 | "NATURAL", 514 | "NCHAR", 515 | "NCLOB", 516 | "NE", 517 | "NESTED_TABLE_ID", 518 | "NEW", 519 | "NEW_TABLE", 520 | "NEXT", 521 | "NEXTVAL", 522 | "NO", 523 | "NOAUDIT", 524 | "NOCHECK", 525 | "NOCOMPRESS", 526 | "NONCLUSTERED", 527 | "NONE", 528 | "NORMALIZE", 529 | "NOT", 530 | "NOTNULL", 531 | "NOWAIT", 532 | "NO_WRITE_TO_BINLOG", 533 | "NTH_VALUE", 534 | "NTILE", 535 | "NULL", 536 | "NULLIF", 537 | "NULLIFZERO", 538 | "NULLS", 539 | "NUMBER", 540 | "NUMERIC", 541 | "NUMPARTS", 542 | "OBID", 543 | "OBJECT", 544 | "OBJECTS", 545 | "OCCURRENCES_REGEX", 546 | "OCTET_LENGTH", 547 | "OF", 548 | "OFF", 549 | "OFFLINE", 550 | "OFFSET", 551 | "OFFSETS", 552 | "OLD", 553 | "OLD_TABLE", 554 | "OMIT", 555 | "ON", 556 | "ONE", 557 | "ONLINE", 558 | "ONLY", 559 | "OPEN", 560 | "OPENDATASOURCE", 561 | "OPENQUERY", 562 | "OPENROWSET", 563 | "OPENXML", 564 | "OPERATION", 565 | "OPTIMIZATION", 566 | "OPTIMIZE", 567 | "OPTIMIZER_COSTS", 568 | "OPTION", 569 | "OPTIONALLY", 570 | "OR", 571 | "ORDER", 572 | "ORDINALITY", 573 | "ORGANIZATION", 574 | "OUT", 575 | "OUTER", 576 | "OUTFILE", 577 | "OUTPUT", 578 | "OVER", 579 | "OVERLAPS", 580 | "OVERLAY", 581 | "OVERRIDE", 582 | "PACKAGE", 583 | "PAD", 584 | "PADDED", 585 | "PARAMETER", 586 | "PARAMETERS", 587 | "PART", 588 | "PARTIAL", 589 | "PARTITION", 590 | "PARTITIONED", 591 | "PARTITIONING", 592 | "PASSWORD", 593 | "PATH", 594 | "PATTERN", 595 | "PCTFREE", 596 | "PER", 597 | "PERCENT", 598 | "PERCENTILE_CONT", 599 | "PERCENTILE_DISC", 600 | "PERCENT_RANK", 601 | "PERIOD", 602 | "PERM", 603 | "PERMANENT", 604 | "PIECESIZE", 605 | "PIVOT", 606 | "PLACING", 607 | "PLAN", 608 | "PORTION", 609 | "POSITION", 610 | "POSITION_REGEX", 611 | "POSTFIX", 612 | "POWER", 613 | "PRECEDES", 614 | "PRECISION", 615 | "PREFIX", 616 | "PREORDER", 617 | "PREPARE", 618 | "PRESERVE", 619 | "PREVVAL", 620 | "PRIMARY", 621 | "PRINT", 622 | "PRIOR", 623 | "PRIQTY", 624 | "PRIVATE", 625 | "PRIVILEGES", 626 | "PROC", 627 | "PROCEDURE", 628 | "PROFILE", 629 | "PROGRAM", 630 | "PROPORTIONAL", 631 | "PROTECTION", 632 | "PSID", 633 | "PTF", 634 | "PUBLIC", 635 | "PURGE", 636 | "QUALIFIED", 637 | "QUALIFY", 638 | "QUANTILE", 639 | "QUERY", 640 | "QUERYNO", 641 | "RADIANS", 642 | "RAISERROR", 643 | "RANDOM", 644 | "RANGE", 645 | "RANGE_N", 646 | "RANK", 647 | "RAW", 648 | "READ", 649 | "READS", 650 | "READTEXT", 651 | "READ_WRITE", 652 | "REAL", 653 | "RECONFIGURE", 654 | "RECURSIVE", 655 | "REF", 656 | "REFERENCES", 657 | "REFERENCING", 658 | "REFRESH", 659 | "REGEXP", 660 | "REGR_AVGX", 661 | "REGR_AVGY", 662 | "REGR_COUNT", 663 | "REGR_INTERCEPT", 664 | "REGR_R2", 665 | "REGR_SLOPE", 666 | "REGR_SXX", 667 | "REGR_SXY", 668 | "REGR_SYY", 669 | "RELATIVE", 670 | "RELEASE", 671 | "RENAME", 672 | "REPEAT", 673 | "REPLACE", 674 | "REPLICATION", 675 | "REPOVERRIDE", 676 | "REQUEST", 677 | "REQUIRE", 678 | "RESIGNAL", 679 | "RESOURCE", 680 | "RESTART", 681 | "RESTORE", 682 | "RESTRICT", 683 | "RESULT", 684 | "RESULT_SET_LOCATOR", 685 | "RESUME", 686 | "RET", 687 | "RETRIEVE", 688 | "RETURN", 689 | "RETURNING", 690 | "RETURNS", 691 | "REVALIDATE", 692 | "REVERT", 693 | "REVOKE", 694 | "RIGHT", 695 | "RIGHTS", 696 | "RLIKE", 697 | "ROLE", 698 | "ROLLBACK", 699 | "ROLLFORWARD", 700 | "ROLLUP", 701 | "ROUND_CEILING", 702 | "ROUND_DOWN", 703 | "ROUND_FLOOR", 704 | "ROUND_HALF_DOWN", 705 | "ROUND_HALF_EVEN", 706 | "ROUND_HALF_UP", 707 | "ROUND_UP", 708 | "ROUTINE", 709 | "ROW", 710 | "ROWCOUNT", 711 | "ROWGUIDCOL", 712 | "ROWID", 713 | "ROWNUM", 714 | "ROWS", 715 | "ROWSET", 716 | "ROW_NUMBER", 717 | "RULE", 718 | "RUN", 719 | "RUNNING", 720 | "SAMPLE", 721 | "SAMPLEID", 722 | "SAVE", 723 | "SAVEPOINT", 724 | "SCHEMA", 725 | "SCHEMAS", 726 | "SCOPE", 727 | "SCRATCHPAD", 728 | "SCROLL", 729 | "SEARCH", 730 | "SECOND", 731 | "SECONDS", 732 | "SECOND_MICROSECOND", 733 | "SECQTY", 734 | "SECTION", 735 | "SECURITY", 736 | "SECURITYAUDIT", 737 | "SEEK", 738 | "SEL", 739 | "SELECT", 740 | "SEMANTICKEYPHRASETABLE", 741 | "SEMANTICSIMILARITYDETAILSTABLE", 742 | "SEMANTICSIMILARITYTABLE", 743 | "SENSITIVE", 744 | "SEPARATOR", 745 | "SEQUENCE", 746 | "SESSION", 747 | "SESSION_USER", 748 | "SET", 749 | "SETRESRATE", 750 | "SETS", 751 | "SETSESSRATE", 752 | "SETUSER", 753 | "SHARE", 754 | "SHOW", 755 | "SHUTDOWN", 756 | "SIGNAL", 757 | "SIMILAR", 758 | "SIMPLE", 759 | "SIN", 760 | "SINH", 761 | "SIZE", 762 | "SKEW", 763 | "SKIP", 764 | "SMALLINT", 765 | "SOME", 766 | "SOUNDEX", 767 | "SOURCE", 768 | "SPACE", 769 | "SPATIAL", 770 | "SPECIFIC", 771 | "SPECIFICTYPE", 772 | "SPOOL", 773 | "SQL", 774 | "SQLEXCEPTION", 775 | "SQLSTATE", 776 | "SQLTEXT", 777 | "SQLWARNING", 778 | "SQL_BIG_RESULT", 779 | "SQL_CALC_FOUND_ROWS", 780 | "SQL_SMALL_RESULT", 781 | "SQRT", 782 | "SS", 783 | "SSL", 784 | "STANDARD", 785 | "START", 786 | "STARTING", 787 | "STARTUP", 788 | "STATE", 789 | "STATEMENT", 790 | "STATIC", 791 | "STATISTICS", 792 | "STAY", 793 | "STDDEV_POP", 794 | "STDDEV_SAMP", 795 | "STEPINFO", 796 | "STOGROUP", 797 | "STORED", 798 | "STORES", 799 | "STRAIGHT_JOIN", 800 | "STRING_CS", 801 | "STRUCTURE", 802 | "STYLE", 803 | "SUBMULTISET", 804 | "SUBSCRIBER", 805 | "SUBSET", 806 | "SUBSTR", 807 | "SUBSTRING", 808 | "SUBSTRING_REGEX", 809 | "SUCCEEDS", 810 | "SUCCESSFUL", 811 | "SUM", 812 | "SUMMARY", 813 | "SUSPEND", 814 | "SYMMETRIC", 815 | "SYNONYM", 816 | "SYSDATE", 817 | "SYSTEM", 818 | "SYSTEM_TIME", 819 | "SYSTEM_USER", 820 | "SYSTIMESTAMP", 821 | "TABLE", 822 | "TABLESAMPLE", 823 | "TABLESPACE", 824 | "TAN", 825 | "TANH", 826 | "TBL_CS", 827 | "TEMPORARY", 828 | "TERMINATE", 829 | "TERMINATED", 830 | "TEXTSIZE", 831 | "THAN", 832 | "THEN", 833 | "THRESHOLD", 834 | "TIME", 835 | "TIMESTAMP", 836 | "TIMEZONE_HOUR", 837 | "TIMEZONE_MINUTE", 838 | "TINYBLOB", 839 | "TINYINT", 840 | "TINYTEXT", 841 | "TITLE", 842 | "TO", 843 | "TOP", 844 | "TRACE", 845 | "TRAILING", 846 | "TRAN", 847 | "TRANSACTION", 848 | "TRANSLATE", 849 | "TRANSLATE_CHK", 850 | "TRANSLATE_REGEX", 851 | "TRANSLATION", 852 | "TREAT", 853 | "TRIGGER", 854 | "TRIM", 855 | "TRIM_ARRAY", 856 | "TRUE", 857 | "TRUNCATE", 858 | "TRY_CONVERT", 859 | "TSEQUAL", 860 | "TYPE", 861 | "UC", 862 | "UESCAPE", 863 | "UID", 864 | "UNDEFINED", 865 | "UNDER", 866 | "UNDO", 867 | "UNION", 868 | "UNIQUE", 869 | "UNKNOWN", 870 | "UNLOCK", 871 | "UNNEST", 872 | "UNPIVOT", 873 | "UNSIGNED", 874 | "UNTIL", 875 | "UPD", 876 | "UPDATE", 877 | "UPDATETEXT", 878 | "UPPER", 879 | "UPPERCASE", 880 | "USAGE", 881 | "USE", 882 | "USER", 883 | "USING", 884 | "UTC_DATE", 885 | "UTC_TIME", 886 | "UTC_TIMESTAMP", 887 | "VALIDATE", 888 | "VALIDPROC", 889 | "VALUE", 890 | "VALUES", 891 | "VALUE_OF", 892 | "VARBINARY", 893 | "VARBYTE", 894 | "VARCHAR", 895 | "VARCHAR2", 896 | "VARCHARACTER", 897 | "VARGRAPHIC", 898 | "VARIABLE", 899 | "VARIADIC", 900 | "VARIANT", 901 | "VARYING", 902 | "VAR_POP", 903 | "VAR_SAMP", 904 | "VCAT", 905 | "VERBOSE", 906 | "VERSIONING", 907 | "VIEW", 908 | "VIRTUAL", 909 | "VOLATILE", 910 | "VOLUMES", 911 | "WAIT", 912 | "WAITFOR", 913 | "WHEN", 914 | "WHENEVER", 915 | "WHERE", 916 | "WHILE", 917 | "WIDTH_BUCKET", 918 | "WINDOW", 919 | "WITH", 920 | "WITHIN", 921 | "WITHIN_GROUP", 922 | "WITHOUT", 923 | "WLM", 924 | "WORK", 925 | "WRITE", 926 | "WRITETEXT", 927 | "XMLCAST", 928 | "XMLEXISTS", 929 | "XMLNAMESPACES", 930 | "XOR", 931 | "YEAR", 932 | "YEARS", 933 | "YEAR_MONTH", 934 | "ZEROFILL", 935 | "ZEROIFNULL", 936 | "ZONE", 937 | }; 938 | } 939 | -------------------------------------------------------------------------------- /src/main/java/com/orangecyberdefense/sqltrees/SQLDSL.java: -------------------------------------------------------------------------------- 1 | package com.orangecyberdefense.sqltrees; 2 | 3 | import java.util.Arrays; 4 | import java.util.List; 5 | import java.util.regex.Pattern; 6 | 7 | public final class SQLDSL { 8 | // private visibility since instantiating this class makes no sense 9 | private SQLDSL() { return; } 10 | 11 | public static AST num(long n) { 12 | return new AST(Long.valueOf(n).toString(), null, 0); 13 | } 14 | 15 | public static AST str(String s) { 16 | return new StrLit(s); 17 | } 18 | 19 | private static Pattern allowedIdent = 20 | Pattern.compile("^[a-zA-Z][a-zA-Z0-9]*$"); 21 | 22 | public static AST id(String s) { 23 | if (!allowedIdent.matcher(s).matches() 24 | || ReservedWords.isReserved(s)) { 25 | throw new IllegalArgumentException("Invalid ident: " + s); 26 | } 27 | return new AST(s, null, 0); 28 | } 29 | 30 | public static AST star = new AST("*", null, 0); 31 | 32 | public static AST eq(AST e0, AST e1) { 33 | return new OperatorAST("=", new AST[]{ e0, e1 }, 100, null); 34 | } 35 | 36 | public static AST sum(AST... exprs) { 37 | return new OperatorAST("+", exprs, 50, null); 38 | } 39 | 40 | public static AST tuple(AST... elements) { 41 | return new OperatorAST(",", elements, 200, null); 42 | } 43 | 44 | public static AST select(AST... elements) { 45 | return new AST("select", elements, 1000); 46 | } 47 | 48 | public static AST from(AST e) { 49 | return new AST("from", new AST[]{ e }, 201); 50 | } 51 | 52 | public static AST where(AST c) { 53 | return new AST("where", new AST[]{ c }, 201); 54 | } 55 | 56 | public static AST trueExpr = eq(num(1), num(1)); 57 | public static AST falseExpr = eq(num(0), num(1)); 58 | 59 | public static AST andArray(AST[] exprs) { 60 | return new OperatorAST("and", exprs, 150, trueExpr); 61 | } 62 | 63 | public static AST andList(List exprs) { 64 | return andArray(exprs.toArray(new AST[0])); 65 | } 66 | 67 | public static AST and(AST... exprs) { 68 | return andArray(exprs); 69 | } 70 | 71 | public static AST orArray(AST[] exprs) { 72 | return new OperatorAST("or", exprs, 150, falseExpr); 73 | } 74 | 75 | public static AST orList(List exprs) { 76 | return orArray(exprs.toArray(new AST[0])); 77 | } 78 | 79 | public static AST or(AST... exprs) { 80 | return orArray(exprs); 81 | } 82 | } 83 | -------------------------------------------------------------------------------- /src/main/java/com/orangecyberdefense/sqltrees/StrLit.java: -------------------------------------------------------------------------------- 1 | package com.orangecyberdefense.sqltrees; 2 | 3 | import java.util.Arrays; 4 | import java.sql.Connection; 5 | import java.sql.ResultSet; 6 | import java.sql.SQLException; 7 | 8 | class StrLit extends AST { 9 | StrLit(String label) { 10 | super(label, null, 0); 11 | } 12 | 13 | void writeTo(CompiledStatement b) { 14 | b.addStringParam(this.label); 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /src/test/java/com/orangecyberdefense/sqltrees/CompiledStatementTest.java: -------------------------------------------------------------------------------- 1 | package com.orangecyberdefense.sqltrees; 2 | 3 | import static org.junit.Assert.assertEquals; 4 | import org.junit.Test; 5 | 6 | public class CompiledStatementTest { 7 | @Test 8 | public void testAddStringParam() { 9 | CompiledStatement s = new CompiledStatement(); 10 | s.addStringParam("hello"); 11 | assertEquals(s.getTpl(), "? "); 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /src/test/java/com/orangecyberdefense/sqltrees/CriterionTest.java: -------------------------------------------------------------------------------- 1 | package com.orangecyberdefense.sqltrees; 2 | 3 | import static org.junit.Assert.assertEquals; 4 | import org.junit.Test; 5 | 6 | import java.sql.PreparedStatement; 7 | import java.sql.ResultSet; 8 | import java.sql.SQLException; 9 | 10 | public class CriterionTest extends Search { 11 | // BEGIN_ARTICLE 12 | String computeCriterion(String[] fields, String[] values) { 13 | StringBuffer b = new StringBuffer(); 14 | for (int i = 0; i < Math.min(values.length, fields.length); i++) { 15 | if (values[i] != null) { 16 | b.append(" AND " + fields[i] + " = '" + values[i] + "'"); 17 | } 18 | } 19 | return b.toString(); 20 | } 21 | 22 | PreparedStatement buildStatement(int y, String[] fields, 23 | String[] values) 24 | throws SQLException { 25 | String crit = computeCriterion(fields, values); 26 | String s = "SELECT * FROM songs WHERE yearofsong = ?" + crit; 27 | PreparedStatement ps = con.prepareStatement(s); 28 | ps.setInt(1, y); 29 | return ps; 30 | } 31 | 32 | ResultSet search(int y, String[] fields, String[] values) 33 | throws SQLException { 34 | return buildStatement(y, fields, values).executeQuery(); 35 | } 36 | // END_ARTICLE 37 | 38 | String preBuildStatement(int y, String[] fields, 39 | String[] values) 40 | throws SQLException { 41 | String crit = computeCriterion(fields, values); 42 | String s = "SELECT * FROM songs WHERE yearofsong = ?" + crit; 43 | return s; 44 | } 45 | 46 | @Test 47 | public void testPreBuildStatement() 48 | throws SQLException { 49 | String[] fields = { "songtitle" }; 50 | String[] values = { "I'm a loser" }; 51 | String s = preBuildStatement(42, fields, values); 52 | assertEquals(s, "SELECT * FROM songs WHERE yearofsong = ? AND songtitle = 'I'm a loser'"); 53 | } 54 | 55 | } 56 | -------------------------------------------------------------------------------- /src/test/java/com/orangecyberdefense/sqltrees/Search.java: -------------------------------------------------------------------------------- 1 | package com.orangecyberdefense.sqltrees; 2 | 3 | import java.sql.*; 4 | // import org.sqlite.JDBC; 5 | 6 | import static com.orangecyberdefense.sqltrees.SQLDSL.*; 7 | 8 | public abstract class Search { 9 | String songtitle = "I'm a loser"; 10 | String author = "Lennon"; 11 | String[] fields = { "songtitle", "author" }; 12 | String[] values = { songtitle, author }; 13 | AST tree = select(star, from(id("songs")), 14 | where(and(eq(id("yearofsong"), num(1964)), 15 | and(eq(id("songtitle"), str(songtitle)), 16 | eq(id("author"), str(author)))))); 17 | String expected_tpl = 18 | "select * from songs where yearofsong = 1964 and ( songtitle = ? and author = ? ) "; 19 | String[] expected_args = { songtitle, author }; 20 | 21 | String dburl = "jdbc:sqlite:test.db"; 22 | Connection con = null; 23 | 24 | public void init() throws SQLException { 25 | con = DriverManager.getConnection(dburl); 26 | } 27 | 28 | abstract ResultSet search(int y, String[] fields, String[] values) throws SQLException; 29 | 30 | } 31 | -------------------------------------------------------------------------------- /src/test/java/com/orangecyberdefense/sqltrees/SecureCriterionTest.java: -------------------------------------------------------------------------------- 1 | package com.orangecyberdefense.sqltrees; 2 | 3 | import static org.junit.Assert.assertEquals; 4 | import static org.junit.Assert.assertArrayEquals; 5 | import org.junit.Test; 6 | 7 | import java.sql.ResultSet; 8 | import java.sql.SQLException; 9 | 10 | import java.util.ArrayList; 11 | 12 | import static com.orangecyberdefense.sqltrees.SQLDSL.*; 13 | 14 | 15 | public class SecureCriterionTest extends Search { 16 | // BEGIN_ARTICLE 17 | AST computeCriterion(String[] fields, String[] values) { 18 | ArrayList la = new ArrayList(); 19 | for (int i = 0; i < Math.min(values.length, fields.length); i++) { 20 | if (values[i] != null) { 21 | la.add(eq(id(fields[i]), str(values[i]))); 22 | } 23 | } 24 | return andList(la); 25 | } 26 | 27 | AST buildStatement(int y, String[] fields, String[] values) { 28 | return select(star, 29 | from(id("songs")), 30 | where(and(eq(id("yearofsong"), num(y)), 31 | computeCriterion(fields, values)))); 32 | } 33 | 34 | ResultSet search(int y, String[] fields, String[] values) 35 | throws SQLException { 36 | return buildStatement(y, fields, values).execute(con); 37 | } 38 | // END_ARTICLE 39 | 40 | CompiledStatement preSearch(int y, String[] fields, String[] values) { 41 | return buildStatement(y, fields, values).compile(); 42 | } 43 | 44 | @Test 45 | public void testPreSearch() { 46 | CompiledStatement cs0 = tree.compile(); 47 | CompiledStatement cs1 = preSearch(1964, fields, values); 48 | assertEquals(cs0.getTpl(), cs1.getTpl()); 49 | assertArrayEquals(cs0.getArgs(), cs1.getArgs()); 50 | } 51 | 52 | @Test 53 | public void testCompile() { 54 | CompiledStatement cs = tree.compile(); 55 | assertEquals(expected_tpl, cs.getTpl()); 56 | assertArrayEquals(expected_args, cs.getArgs()); 57 | } 58 | } 59 | --------------------------------------------------------------------------------