├── .gitignore ├── LICENSE ├── README.md ├── legacy └── shunting_yard.c ├── makefile ├── src ├── Main.hs └── ShuntingYard.hs └── test ├── exponents ├── arith1.txt ├── arith2.txt ├── arith3.txt ├── arith4.txt └── arith5.txt ├── floordiv ├── arith1.txt └── arith2.txt ├── new_failing_tests ├── bad-parens1.txt ├── bad-parens2.txt ├── bad-parens3.txt ├── bad-parens4.txt ├── bad-parens5.txt ├── bad-prefix-op.txt ├── bad-prefix-op2.txt ├── bad-prefix-op3.txt ├── bad-prefix-op4.txt ├── bad-spaces1.txt ├── bad-spaces2.txt ├── bad-spaces3.txt ├── bad-spaces4.txt ├── bad-spaces5.txt ├── bad-spaces6.txt ├── bad-terms1.txt ├── bad-terms2.txt ├── bad-terms3.txt ├── bad-terms4.txt ├── missing-term1.txt ├── missing-term2.txt ├── missing-term3.txt ├── missing-term4.txt ├── missing-term5.txt ├── missing-term6.txt └── missing-term7.txt ├── new_tests ├── arith1.txt ├── arith2.txt ├── arith3.txt ├── arith4.txt ├── arith5.txt ├── arith6.txt ├── arith7.txt ├── arith8.txt └── arith9.txt ├── new_whitespace_tests ├── arith1.txt ├── arith10.txt ├── arith11.txt ├── arith12.txt ├── arith2.txt ├── arith3.txt ├── arith4.txt ├── arith5.txt ├── arith6.txt ├── arith7.txt ├── arith8.txt ├── arith9.txt ├── arith_nested_parens1.txt ├── arith_nested_parens2.txt ├── arith_nested_parens3.txt ├── arith_nested_parens4.txt ├── arith_nested_parens5.txt ├── arith_nested_parens6.txt ├── arith_nested_parens7.txt ├── arith_nested_parens8.txt └── arith_nested_parens9.txt ├── prefix_ops ├── bang.txt ├── bang2.txt ├── bang3.txt ├── bang4.txt ├── bang5.txt ├── bang6.txt ├── bang7.txt ├── bang8.txt ├── long.txt ├── long2.txt ├── long3.txt ├── negate.txt ├── negate2.txt ├── negate3.txt ├── negate4.txt ├── space.txt ├── space2.txt ├── space3.txt ├── space4.txt ├── space5.txt ├── space6.txt ├── space7.txt ├── space8.txt └── space9.txt ├── rational ├── arith1.txt ├── arith2.txt ├── arith3.txt ├── arith4.txt └── arith5.txt ├── run_tests ├── tests ├── add.txt ├── add2.txt ├── add3.txt ├── add4.txt ├── long.txt ├── mult.txt ├── mult2.txt ├── parens.txt ├── parens2.txt └── parens3.txt ├── whitespace_free_tests ├── arith1.txt ├── arith2.txt ├── arith3.txt ├── arith4.txt ├── arith5.txt ├── arith6.txt └── arith7.txt └── whitespace_tests ├── whitespace.txt ├── whitespace2.txt ├── whitespace3.txt ├── whitespace4.txt └── whitespace5.txt /.gitignore: -------------------------------------------------------------------------------- 1 | bin/ 2 | .cache/ 3 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU AFFERO GENERAL PUBLIC LICENSE 2 | Version 3, 19 November 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 Affero General Public License is a free, copyleft license for 11 | software and other kinds of works, specifically designed to ensure 12 | cooperation with the community in the case of network server software. 13 | 14 | The licenses for most software and other practical works are designed 15 | to take away your freedom to share and change the works. By contrast, 16 | our General Public Licenses are intended to guarantee your freedom to 17 | share and change all versions of a program--to make sure it remains free 18 | software for all its users. 19 | 20 | When we speak of free software, we are referring to freedom, not 21 | price. Our General Public Licenses are designed to make sure that you 22 | have the freedom to distribute copies of free software (and charge for 23 | them if you wish), that you receive source code or can get it if you 24 | want it, that you can change the software or use pieces of it in new 25 | free programs, and that you know you can do these things. 26 | 27 | Developers that use our General Public Licenses protect your rights 28 | with two steps: (1) assert copyright on the software, and (2) offer 29 | you this License which gives you legal permission to copy, distribute 30 | and/or modify the software. 31 | 32 | A secondary benefit of defending all users' freedom is that 33 | improvements made in alternate versions of the program, if they 34 | receive widespread use, become available for other developers to 35 | incorporate. Many developers of free software are heartened and 36 | encouraged by the resulting cooperation. However, in the case of 37 | software used on network servers, this result may fail to come about. 38 | The GNU General Public License permits making a modified version and 39 | letting the public access it on a server without ever releasing its 40 | source code to the public. 41 | 42 | The GNU Affero General Public License is designed specifically to 43 | ensure that, in such cases, the modified source code becomes available 44 | to the community. It requires the operator of a network server to 45 | provide the source code of the modified version running there to the 46 | users of that server. Therefore, public use of a modified version, on 47 | a publicly accessible server, gives the public access to the source 48 | code of the modified version. 49 | 50 | An older license, called the Affero General Public License and 51 | published by Affero, was designed to accomplish similar goals. This is 52 | a different license, not a version of the Affero GPL, but Affero has 53 | released a new version of the Affero GPL which permits relicensing under 54 | this license. 55 | 56 | The precise terms and conditions for copying, distribution and 57 | modification follow. 58 | 59 | TERMS AND CONDITIONS 60 | 61 | 0. Definitions. 62 | 63 | "This License" refers to version 3 of the GNU Affero General Public License. 64 | 65 | "Copyright" also means copyright-like laws that apply to other kinds of 66 | works, such as semiconductor masks. 67 | 68 | "The Program" refers to any copyrightable work licensed under this 69 | License. Each licensee is addressed as "you". "Licensees" and 70 | "recipients" may be individuals or organizations. 71 | 72 | To "modify" a work means to copy from or adapt all or part of the work 73 | in a fashion requiring copyright permission, other than the making of an 74 | exact copy. The resulting work is called a "modified version" of the 75 | earlier work or a work "based on" the earlier work. 76 | 77 | A "covered work" means either the unmodified Program or a work based 78 | on the Program. 79 | 80 | To "propagate" a work means to do anything with it that, without 81 | permission, would make you directly or secondarily liable for 82 | infringement under applicable copyright law, except executing it on a 83 | computer or modifying a private copy. Propagation includes copying, 84 | distribution (with or without modification), making available to the 85 | public, and in some countries other activities as well. 86 | 87 | To "convey" a work means any kind of propagation that enables other 88 | parties to make or receive copies. Mere interaction with a user through 89 | a computer network, with no transfer of a copy, is not conveying. 90 | 91 | An interactive user interface displays "Appropriate Legal Notices" 92 | to the extent that it includes a convenient and prominently visible 93 | feature that (1) displays an appropriate copyright notice, and (2) 94 | tells the user that there is no warranty for the work (except to the 95 | extent that warranties are provided), that licensees may convey the 96 | work under this License, and how to view a copy of this License. If 97 | the interface presents a list of user commands or options, such as a 98 | menu, a prominent item in the list meets this criterion. 99 | 100 | 1. Source Code. 101 | 102 | The "source code" for a work means the preferred form of the work 103 | for making modifications to it. "Object code" means any non-source 104 | form of a work. 105 | 106 | A "Standard Interface" means an interface that either is an official 107 | standard defined by a recognized standards body, or, in the case of 108 | interfaces specified for a particular programming language, one that 109 | is widely used among developers working in that language. 110 | 111 | The "System Libraries" of an executable work include anything, other 112 | than the work as a whole, that (a) is included in the normal form of 113 | packaging a Major Component, but which is not part of that Major 114 | Component, and (b) serves only to enable use of the work with that 115 | Major Component, or to implement a Standard Interface for which an 116 | implementation is available to the public in source code form. A 117 | "Major Component", in this context, means a major essential component 118 | (kernel, window system, and so on) of the specific operating system 119 | (if any) on which the executable work runs, or a compiler used to 120 | produce the work, or an object code interpreter used to run it. 121 | 122 | The "Corresponding Source" for a work in object code form means all 123 | the source code needed to generate, install, and (for an executable 124 | work) run the object code and to modify the work, including scripts to 125 | control those activities. However, it does not include the work's 126 | System Libraries, or general-purpose tools or generally available free 127 | programs which are used unmodified in performing those activities but 128 | which are not part of the work. For example, Corresponding Source 129 | includes interface definition files associated with source files for 130 | the work, and the source code for shared libraries and dynamically 131 | linked subprograms that the work is specifically designed to require, 132 | such as by intimate data communication or control flow between those 133 | subprograms and other parts of the work. 134 | 135 | The Corresponding Source need not include anything that users 136 | can regenerate automatically from other parts of the Corresponding 137 | Source. 138 | 139 | The Corresponding Source for a work in source code form is that 140 | same work. 141 | 142 | 2. Basic Permissions. 143 | 144 | All rights granted under this License are granted for the term of 145 | copyright on the Program, and are irrevocable provided the stated 146 | conditions are met. This License explicitly affirms your unlimited 147 | permission to run the unmodified Program. The output from running a 148 | covered work is covered by this License only if the output, given its 149 | content, constitutes a covered work. This License acknowledges your 150 | rights of fair use or other equivalent, as provided by copyright law. 151 | 152 | You may make, run and propagate covered works that you do not 153 | convey, without conditions so long as your license otherwise remains 154 | in force. You may convey covered works to others for the sole purpose 155 | of having them make modifications exclusively for you, or provide you 156 | with facilities for running those works, provided that you comply with 157 | the terms of this License in conveying all material for which you do 158 | not control copyright. Those thus making or running the covered works 159 | for you must do so exclusively on your behalf, under your direction 160 | and control, on terms that prohibit them from making any copies of 161 | your copyrighted material outside their relationship with you. 162 | 163 | Conveying under any other circumstances is permitted solely under 164 | the conditions stated below. Sublicensing is not allowed; section 10 165 | makes it unnecessary. 166 | 167 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 168 | 169 | No covered work shall be deemed part of an effective technological 170 | measure under any applicable law fulfilling obligations under article 171 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 172 | similar laws prohibiting or restricting circumvention of such 173 | measures. 174 | 175 | When you convey a covered work, you waive any legal power to forbid 176 | circumvention of technological measures to the extent such circumvention 177 | is effected by exercising rights under this License with respect to 178 | the covered work, and you disclaim any intention to limit operation or 179 | modification of the work as a means of enforcing, against the work's 180 | users, your or third parties' legal rights to forbid circumvention of 181 | technological measures. 182 | 183 | 4. Conveying Verbatim Copies. 184 | 185 | You may convey verbatim copies of the Program's source code as you 186 | receive it, in any medium, provided that you conspicuously and 187 | appropriately publish on each copy an appropriate copyright notice; 188 | keep intact all notices stating that this License and any 189 | non-permissive terms added in accord with section 7 apply to the code; 190 | keep intact all notices of the absence of any warranty; and give all 191 | recipients a copy of this License along with the Program. 192 | 193 | You may charge any price or no price for each copy that you convey, 194 | and you may offer support or warranty protection for a fee. 195 | 196 | 5. Conveying Modified Source Versions. 197 | 198 | You may convey a work based on the Program, or the modifications to 199 | produce it from the Program, in the form of source code under the 200 | terms of section 4, provided that you also meet all of these conditions: 201 | 202 | a) The work must carry prominent notices stating that you modified 203 | it, and giving a relevant date. 204 | 205 | b) The work must carry prominent notices stating that it is 206 | released under this License and any conditions added under section 207 | 7. This requirement modifies the requirement in section 4 to 208 | "keep intact all notices". 209 | 210 | c) You must license the entire work, as a whole, under this 211 | License to anyone who comes into possession of a copy. This 212 | License will therefore apply, along with any applicable section 7 213 | additional terms, to the whole of the work, and all its parts, 214 | regardless of how they are packaged. This License gives no 215 | permission to license the work in any other way, but it does not 216 | invalidate such permission if you have separately received it. 217 | 218 | d) If the work has interactive user interfaces, each must display 219 | Appropriate Legal Notices; however, if the Program has interactive 220 | interfaces that do not display Appropriate Legal Notices, your 221 | work need not make them do so. 222 | 223 | A compilation of a covered work with other separate and independent 224 | works, which are not by their nature extensions of the covered work, 225 | and which are not combined with it such as to form a larger program, 226 | in or on a volume of a storage or distribution medium, is called an 227 | "aggregate" if the compilation and its resulting copyright are not 228 | used to limit the access or legal rights of the compilation's users 229 | beyond what the individual works permit. Inclusion of a covered work 230 | in an aggregate does not cause this License to apply to the other 231 | parts of the aggregate. 232 | 233 | 6. Conveying Non-Source Forms. 234 | 235 | You may convey a covered work in object code form under the terms 236 | of sections 4 and 5, provided that you also convey the 237 | machine-readable Corresponding Source under the terms of this License, 238 | in one of these ways: 239 | 240 | a) Convey the object code in, or embodied in, a physical product 241 | (including a physical distribution medium), accompanied by the 242 | Corresponding Source fixed on a durable physical medium 243 | customarily used for software interchange. 244 | 245 | b) Convey the object code in, or embodied in, a physical product 246 | (including a physical distribution medium), accompanied by a 247 | written offer, valid for at least three years and valid for as 248 | long as you offer spare parts or customer support for that product 249 | model, to give anyone who possesses the object code either (1) a 250 | copy of the Corresponding Source for all the software in the 251 | product that is covered by this License, on a durable physical 252 | medium customarily used for software interchange, for a price no 253 | more than your reasonable cost of physically performing this 254 | conveying of source, or (2) access to copy the 255 | Corresponding Source from a network server at no charge. 256 | 257 | c) Convey individual copies of the object code with a copy of the 258 | written offer to provide the Corresponding Source. This 259 | alternative is allowed only occasionally and noncommercially, and 260 | only if you received the object code with such an offer, in accord 261 | with subsection 6b. 262 | 263 | d) Convey the object code by offering access from a designated 264 | place (gratis or for a charge), and offer equivalent access to the 265 | Corresponding Source in the same way through the same place at no 266 | further charge. You need not require recipients to copy the 267 | Corresponding Source along with the object code. If the place to 268 | copy the object code is a network server, the Corresponding Source 269 | may be on a different server (operated by you or a third party) 270 | that supports equivalent copying facilities, provided you maintain 271 | clear directions next to the object code saying where to find the 272 | Corresponding Source. Regardless of what server hosts the 273 | Corresponding Source, you remain obligated to ensure that it is 274 | available for as long as needed to satisfy these requirements. 275 | 276 | e) Convey the object code using peer-to-peer transmission, provided 277 | you inform other peers where the object code and Corresponding 278 | Source of the work are being offered to the general public at no 279 | charge under subsection 6d. 280 | 281 | A separable portion of the object code, whose source code is excluded 282 | from the Corresponding Source as a System Library, need not be 283 | included in conveying the object code work. 284 | 285 | A "User Product" is either (1) a "consumer product", which means any 286 | tangible personal property which is normally used for personal, family, 287 | or household purposes, or (2) anything designed or sold for incorporation 288 | into a dwelling. In determining whether a product is a consumer product, 289 | doubtful cases shall be resolved in favor of coverage. For a particular 290 | product received by a particular user, "normally used" refers to a 291 | typical or common use of that class of product, regardless of the status 292 | of the particular user or of the way in which the particular user 293 | actually uses, or expects or is expected to use, the product. A product 294 | is a consumer product regardless of whether the product has substantial 295 | commercial, industrial or non-consumer uses, unless such uses represent 296 | the only significant mode of use of the product. 297 | 298 | "Installation Information" for a User Product means any methods, 299 | procedures, authorization keys, or other information required to install 300 | and execute modified versions of a covered work in that User Product from 301 | a modified version of its Corresponding Source. The information must 302 | suffice to ensure that the continued functioning of the modified object 303 | code is in no case prevented or interfered with solely because 304 | modification has been made. 305 | 306 | If you convey an object code work under this section in, or with, or 307 | specifically for use in, a User Product, and the conveying occurs as 308 | part of a transaction in which the right of possession and use of the 309 | User Product is transferred to the recipient in perpetuity or for a 310 | fixed term (regardless of how the transaction is characterized), the 311 | Corresponding Source conveyed under this section must be accompanied 312 | by the Installation Information. But this requirement does not apply 313 | if neither you nor any third party retains the ability to install 314 | modified object code on the User Product (for example, the work has 315 | been installed in ROM). 316 | 317 | The requirement to provide Installation Information does not include a 318 | requirement to continue to provide support service, warranty, or updates 319 | for a work that has been modified or installed by the recipient, or for 320 | the User Product in which it has been modified or installed. Access to a 321 | network may be denied when the modification itself materially and 322 | adversely affects the operation of the network or violates the rules and 323 | protocols for communication across the network. 324 | 325 | Corresponding Source conveyed, and Installation Information provided, 326 | in accord with this section must be in a format that is publicly 327 | documented (and with an implementation available to the public in 328 | source code form), and must require no special password or key for 329 | unpacking, reading or copying. 330 | 331 | 7. Additional Terms. 332 | 333 | "Additional permissions" are terms that supplement the terms of this 334 | License by making exceptions from one or more of its conditions. 335 | Additional permissions that are applicable to the entire Program shall 336 | be treated as though they were included in this License, to the extent 337 | that they are valid under applicable law. If additional permissions 338 | apply only to part of the Program, that part may be used separately 339 | under those permissions, but the entire Program remains governed by 340 | this License without regard to the additional permissions. 341 | 342 | When you convey a copy of a covered work, you may at your option 343 | remove any additional permissions from that copy, or from any part of 344 | it. (Additional permissions may be written to require their own 345 | removal in certain cases when you modify the work.) You may place 346 | additional permissions on material, added by you to a covered work, 347 | for which you have or can give appropriate copyright permission. 348 | 349 | Notwithstanding any other provision of this License, for material you 350 | add to a covered work, you may (if authorized by the copyright holders of 351 | that material) supplement the terms of this License with terms: 352 | 353 | a) Disclaiming warranty or limiting liability differently from the 354 | terms of sections 15 and 16 of this License; or 355 | 356 | b) Requiring preservation of specified reasonable legal notices or 357 | author attributions in that material or in the Appropriate Legal 358 | Notices displayed by works containing it; or 359 | 360 | c) Prohibiting misrepresentation of the origin of that material, or 361 | requiring that modified versions of such material be marked in 362 | reasonable ways as different from the original version; or 363 | 364 | d) Limiting the use for publicity purposes of names of licensors or 365 | authors of the material; or 366 | 367 | e) Declining to grant rights under trademark law for use of some 368 | trade names, trademarks, or service marks; or 369 | 370 | f) Requiring indemnification of licensors and authors of that 371 | material by anyone who conveys the material (or modified versions of 372 | it) with contractual assumptions of liability to the recipient, for 373 | any liability that these contractual assumptions directly impose on 374 | those licensors and authors. 375 | 376 | All other non-permissive additional terms are considered "further 377 | restrictions" within the meaning of section 10. If the Program as you 378 | received it, or any part of it, contains a notice stating that it is 379 | governed by this License along with a term that is a further 380 | restriction, you may remove that term. If a license document contains 381 | a further restriction but permits relicensing or conveying under this 382 | License, you may add to a covered work material governed by the terms 383 | of that license document, provided that the further restriction does 384 | not survive such relicensing or conveying. 385 | 386 | If you add terms to a covered work in accord with this section, you 387 | must place, in the relevant source files, a statement of the 388 | additional terms that apply to those files, or a notice indicating 389 | where to find the applicable terms. 390 | 391 | Additional terms, permissive or non-permissive, may be stated in the 392 | form of a separately written license, or stated as exceptions; 393 | the above requirements apply either way. 394 | 395 | 8. Termination. 396 | 397 | You may not propagate or modify a covered work except as expressly 398 | provided under this License. Any attempt otherwise to propagate or 399 | modify it is void, and will automatically terminate your rights under 400 | this License (including any patent licenses granted under the third 401 | paragraph of section 11). 402 | 403 | However, if you cease all violation of this License, then your 404 | license from a particular copyright holder is reinstated (a) 405 | provisionally, unless and until the copyright holder explicitly and 406 | finally terminates your license, and (b) permanently, if the copyright 407 | holder fails to notify you of the violation by some reasonable means 408 | prior to 60 days after the cessation. 409 | 410 | Moreover, your license from a particular copyright holder is 411 | reinstated permanently if the copyright holder notifies you of the 412 | violation by some reasonable means, this is the first time you have 413 | received notice of violation of this License (for any work) from that 414 | copyright holder, and you cure the violation prior to 30 days after 415 | your receipt of the notice. 416 | 417 | Termination of your rights under this section does not terminate the 418 | licenses of parties who have received copies or rights from you under 419 | this License. If your rights have been terminated and not permanently 420 | reinstated, you do not qualify to receive new licenses for the same 421 | material under section 10. 422 | 423 | 9. Acceptance Not Required for Having Copies. 424 | 425 | You are not required to accept this License in order to receive or 426 | run a copy of the Program. Ancillary propagation of a covered work 427 | occurring solely as a consequence of using peer-to-peer transmission 428 | to receive a copy likewise does not require acceptance. However, 429 | nothing other than this License grants you permission to propagate or 430 | modify any covered work. These actions infringe copyright if you do 431 | not accept this License. Therefore, by modifying or propagating a 432 | covered work, you indicate your acceptance of this License to do so. 433 | 434 | 10. Automatic Licensing of Downstream Recipients. 435 | 436 | Each time you convey a covered work, the recipient automatically 437 | receives a license from the original licensors, to run, modify and 438 | propagate that work, subject to this License. You are not responsible 439 | for enforcing compliance by third parties with this License. 440 | 441 | An "entity transaction" is a transaction transferring control of an 442 | organization, or substantially all assets of one, or subdividing an 443 | organization, or merging organizations. If propagation of a covered 444 | work results from an entity transaction, each party to that 445 | transaction who receives a copy of the work also receives whatever 446 | licenses to the work the party's predecessor in interest had or could 447 | give under the previous paragraph, plus a right to possession of the 448 | Corresponding Source of the work from the predecessor in interest, if 449 | the predecessor has it or can get it with reasonable efforts. 450 | 451 | You may not impose any further restrictions on the exercise of the 452 | rights granted or affirmed under this License. For example, you may 453 | not impose a license fee, royalty, or other charge for exercise of 454 | rights granted under this License, and you may not initiate litigation 455 | (including a cross-claim or counterclaim in a lawsuit) alleging that 456 | any patent claim is infringed by making, using, selling, offering for 457 | sale, or importing the Program or any portion of it. 458 | 459 | 11. Patents. 460 | 461 | A "contributor" is a copyright holder who authorizes use under this 462 | License of the Program or a work on which the Program is based. The 463 | work thus licensed is called the contributor's "contributor version". 464 | 465 | A contributor's "essential patent claims" are all patent claims 466 | owned or controlled by the contributor, whether already acquired or 467 | hereafter acquired, that would be infringed by some manner, permitted 468 | by this License, of making, using, or selling its contributor version, 469 | but do not include claims that would be infringed only as a 470 | consequence of further modification of the contributor version. For 471 | purposes of this definition, "control" includes the right to grant 472 | patent sublicenses in a manner consistent with the requirements of 473 | this License. 474 | 475 | Each contributor grants you a non-exclusive, worldwide, royalty-free 476 | patent license under the contributor's essential patent claims, to 477 | make, use, sell, offer for sale, import and otherwise run, modify and 478 | propagate the contents of its contributor version. 479 | 480 | In the following three paragraphs, a "patent license" is any express 481 | agreement or commitment, however denominated, not to enforce a patent 482 | (such as an express permission to practice a patent or covenant not to 483 | sue for patent infringement). To "grant" such a patent license to a 484 | party means to make such an agreement or commitment not to enforce a 485 | patent against the party. 486 | 487 | If you convey a covered work, knowingly relying on a patent license, 488 | and the Corresponding Source of the work is not available for anyone 489 | to copy, free of charge and under the terms of this License, through a 490 | publicly available network server or other readily accessible means, 491 | then you must either (1) cause the Corresponding Source to be so 492 | available, or (2) arrange to deprive yourself of the benefit of the 493 | patent license for this particular work, or (3) arrange, in a manner 494 | consistent with the requirements of this License, to extend the patent 495 | license to downstream recipients. "Knowingly relying" means you have 496 | actual knowledge that, but for the patent license, your conveying the 497 | covered work in a country, or your recipient's use of the covered work 498 | in a country, would infringe one or more identifiable patents in that 499 | country that you have reason to believe are valid. 500 | 501 | If, pursuant to or in connection with a single transaction or 502 | arrangement, you convey, or propagate by procuring conveyance of, a 503 | covered work, and grant a patent license to some of the parties 504 | receiving the covered work authorizing them to use, propagate, modify 505 | or convey a specific copy of the covered work, then the patent license 506 | you grant is automatically extended to all recipients of the covered 507 | work and works based on it. 508 | 509 | A patent license is "discriminatory" if it does not include within 510 | the scope of its coverage, prohibits the exercise of, or is 511 | conditioned on the non-exercise of one or more of the rights that are 512 | specifically granted under this License. You may not convey a covered 513 | work if you are a party to an arrangement with a third party that is 514 | in the business of distributing software, under which you make payment 515 | to the third party based on the extent of your activity of conveying 516 | the work, and under which the third party grants, to any of the 517 | parties who would receive the covered work from you, a discriminatory 518 | patent license (a) in connection with copies of the covered work 519 | conveyed by you (or copies made from those copies), or (b) primarily 520 | for and in connection with specific products or compilations that 521 | contain the covered work, unless you entered into that arrangement, 522 | or that patent license was granted, prior to 28 March 2007. 523 | 524 | Nothing in this License shall be construed as excluding or limiting 525 | any implied license or other defenses to infringement that may 526 | otherwise be available to you under applicable patent law. 527 | 528 | 12. No Surrender of Others' Freedom. 529 | 530 | If conditions are imposed on you (whether by court order, agreement or 531 | otherwise) that contradict the conditions of this License, they do not 532 | excuse you from the conditions of this License. If you cannot convey a 533 | covered work so as to satisfy simultaneously your obligations under this 534 | License and any other pertinent obligations, then as a consequence you may 535 | not convey it at all. For example, if you agree to terms that obligate you 536 | to collect a royalty for further conveying from those to whom you convey 537 | the Program, the only way you could satisfy both those terms and this 538 | License would be to refrain entirely from conveying the Program. 539 | 540 | 13. Remote Network Interaction; Use with the GNU General Public License. 541 | 542 | Notwithstanding any other provision of this License, if you modify the 543 | Program, your modified version must prominently offer all users 544 | interacting with it remotely through a computer network (if your version 545 | supports such interaction) an opportunity to receive the Corresponding 546 | Source of your version by providing access to the Corresponding Source 547 | from a network server at no charge, through some standard or customary 548 | means of facilitating copying of software. This Corresponding Source 549 | shall include the Corresponding Source for any work covered by version 3 550 | of the GNU General Public License that is incorporated pursuant to the 551 | following paragraph. 552 | 553 | Notwithstanding any other provision of this License, you have 554 | permission to link or combine any covered work with a work licensed 555 | under version 3 of the GNU General Public License into a single 556 | combined work, and to convey the resulting work. The terms of this 557 | License will continue to apply to the part which is the covered work, 558 | but the work with which it is combined will remain governed by version 559 | 3 of the GNU General Public License. 560 | 561 | 14. Revised Versions of this License. 562 | 563 | The Free Software Foundation may publish revised and/or new versions of 564 | the GNU Affero General Public License from time to time. Such new versions 565 | will be similar in spirit to the present version, but may differ in detail to 566 | address new problems or concerns. 567 | 568 | Each version is given a distinguishing version number. If the 569 | Program specifies that a certain numbered version of the GNU Affero General 570 | Public License "or any later version" applies to it, you have the 571 | option of following the terms and conditions either of that numbered 572 | version or of any later version published by the Free Software 573 | Foundation. If the Program does not specify a version number of the 574 | GNU Affero General Public License, you may choose any version ever published 575 | by the Free Software Foundation. 576 | 577 | If the Program specifies that a proxy can decide which future 578 | versions of the GNU Affero General Public License can be used, that proxy's 579 | public statement of acceptance of a version permanently authorizes you 580 | to choose that version for the Program. 581 | 582 | Later license versions may give you additional or different 583 | permissions. However, no additional obligations are imposed on any 584 | author or copyright holder as a result of your choosing to follow a 585 | later version. 586 | 587 | 15. Disclaimer of Warranty. 588 | 589 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 590 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 591 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 592 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 593 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 594 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 595 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 596 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 597 | 598 | 16. Limitation of Liability. 599 | 600 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 601 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 602 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 603 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 604 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 605 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 606 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 607 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 608 | SUCH DAMAGES. 609 | 610 | 17. Interpretation of Sections 15 and 16. 611 | 612 | If the disclaimer of warranty and limitation of liability provided 613 | above cannot be given local legal effect according to their terms, 614 | reviewing courts shall apply local law that most closely approximates 615 | an absolute waiver of all civil liability in connection with the 616 | Program, unless a warranty or assumption of liability accompanies a 617 | copy of the Program in return for a fee. 618 | 619 | END OF TERMS AND CONDITIONS 620 | 621 | How to Apply These Terms to Your New Programs 622 | 623 | If you develop a new program, and you want it to be of the greatest 624 | possible use to the public, the best way to achieve this is to make it 625 | free software which everyone can redistribute and change under these terms. 626 | 627 | To do so, attach the following notices to the program. It is safest 628 | to attach them to the start of each source file to most effectively 629 | state the exclusion of warranty; and each file should have at least 630 | the "copyright" line and a pointer to where the full notice is found. 631 | 632 | 633 | Copyright (C) 634 | 635 | This program is free software: you can redistribute it and/or modify 636 | it under the terms of the GNU Affero General Public License as published 637 | by the Free Software Foundation, either version 3 of the License, or 638 | (at your option) any later version. 639 | 640 | This program is distributed in the hope that it will be useful, 641 | but WITHOUT ANY WARRANTY; without even the implied warranty of 642 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 643 | GNU Affero General Public License for more details. 644 | 645 | You should have received a copy of the GNU Affero General Public License 646 | along with this program. If not, see . 647 | 648 | Also add information on how to contact you by electronic and paper mail. 649 | 650 | If your software can interact with users remotely through a computer 651 | network, you should also make sure that it provides a way for users to 652 | get its source. For example, if your program is a web application, its 653 | interface could display a "Source" link that leads users to an archive 654 | of the code. There are many ways you could offer source, and different 655 | solutions will be better for different programs; see section 13 for the 656 | specific requirements. 657 | 658 | You should also get your employer (if you work as a programmer) or school, 659 | if any, to sign a "copyright disclaimer" for the program, if necessary. 660 | For more information on this, and how to apply and follow the GNU AGPL, see 661 | . 662 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # happy-space 2 | 3 | this is a command-line calculator. it supports 4 | 5 | * the infix operations `+`, `-`, `*`, `/`, `%`, `^` 6 | * the prefix operators `~` (negate) and `!` (factorial) 7 | * conventional operator precendence 8 | * parentheses 9 | * whitespace precedence 10 | 11 | ## whitespace precedence? 12 | 13 | that's right! 14 | 15 | ``` 16 | > 3+6/3 17 | 5 18 | > 3 + 6/3 19 | 5 20 | > 3+6 / 3 21 | 3 22 | ``` 23 | 24 | but: 25 | 26 | ``` 27 | > 1+ 2 28 | (line 1, column 4): 29 | unexpected whitespace after `+` 30 | > 1 +2 31 | (line 1, column 4): 32 | unexpected "2" 33 | expecting space after `+` 34 | ``` 35 | 36 | ## dependencies 37 | 38 | * ghc 39 | * make 40 | * dash (for tests) 41 | 42 | ## to build 43 | 44 | run `make` in the top level of the repo. this will create `bin/hscalc`. 45 | 46 | if you experience problems with linking, you can try `make HSFLAGS=-static`. 47 | 48 | you can also `make test`, if you have the appropriate dependencies. 49 | 50 | ## to run 51 | 52 | there are three ways to invoke `hscalc`: 53 | 54 | * running `hscalc` will produce an interactive repl; 55 | * `hscalc "1+2"` will evaluate all the expressions passed as arguments; 56 | * `hscalc -` will read once from standard input and evaluate that. 57 | -------------------------------------------------------------------------------- /legacy/shunting_yard.c: -------------------------------------------------------------------------------- 1 | // parses an expression into an abstract syntax tree using the shunting yard algorithm 2 | // can't handle spaces or parens and accepts single-digit numbers only, lol 3 | 4 | #include 5 | #include 6 | #include 7 | #include 8 | 9 | static const char * input_pointer; 10 | 11 | static bool theres_more_input(void) { 12 | return (*input_pointer != '\0') && (*input_pointer != '\n'); 13 | } 14 | 15 | static void __attribute__((noreturn)) error(char * str) { 16 | printf("error: %s\n", str); 17 | exit(EXIT_FAILURE); 18 | } 19 | 20 | struct stack_obj { 21 | struct ASTNode * obj; 22 | struct stack_obj * next; 23 | }; 24 | 25 | enum token_assoc { 26 | RIGHT_ASSOC, 27 | LEFT_ASSOC 28 | }; 29 | 30 | enum token_type { 31 | TOKEN_TYPE_OPERATOR, 32 | TOKEN_TYPE_TERM, 33 | TOKEN_TYPE_L_PAREN, 34 | TOKEN_TYPE_R_PAREN, 35 | }; 36 | 37 | struct ASTNode { 38 | int precedence; // only if TOKEN_TYPE_OPERATOR 39 | enum token_assoc associativity; // only if TOKEN_TYPE_OPERATOR 40 | struct ASTNode * children_right; // only if TOKEN_TYPE_OPERATOR 41 | struct ASTNode * children_left; // only if TOKEN_TYPE_OPERATOR 42 | enum token_type type; 43 | char val; 44 | }; 45 | 46 | 47 | static void stack_push(struct stack_obj ** stack_p, struct ASTNode * obj) { 48 | if (stack_p == NULL) { 49 | error("hosed pointer"); 50 | } 51 | struct stack_obj * new_node = malloc(sizeof(struct stack_obj)); 52 | assert(new_node); 53 | new_node->obj = obj; 54 | new_node->next = *stack_p; 55 | *stack_p = new_node; 56 | } 57 | 58 | static struct ASTNode * stack_pop(struct stack_obj ** stack_p) { 59 | if (stack_p == NULL) { 60 | error("hosed pointer"); 61 | } else if (*stack_p == NULL) { 62 | error("empty stack"); 63 | } 64 | struct stack_obj * ptr = *stack_p; 65 | struct ASTNode * node = (*stack_p)->obj; 66 | *stack_p = (*stack_p)->next; 67 | free(ptr); 68 | return node; 69 | } 70 | 71 | static struct ASTNode * stack_peek(const struct stack_obj * stack) { 72 | if (stack == NULL) { 73 | error("empty stack"); 74 | } 75 | return stack->obj; 76 | } 77 | 78 | static void pretty_print(const struct ASTNode * tree) { 79 | if (tree->type == TOKEN_TYPE_OPERATOR) { 80 | putchar('('); 81 | putchar(tree->val); 82 | putchar(' '); 83 | pretty_print(tree->children_left); 84 | putchar(' '); 85 | pretty_print(tree->children_right); 86 | putchar(')'); 87 | } else { 88 | putchar(tree->val); 89 | } 90 | } 91 | 92 | static struct ASTNode * parse_token(void) { 93 | struct ASTNode * mem = calloc(sizeof(struct ASTNode), 1); 94 | assert(mem); 95 | 96 | if (! theres_more_input()) { 97 | error("input finished"); 98 | } 99 | char current = *input_pointer; 100 | switch (current) { 101 | case '(': 102 | mem->val = current; 103 | mem->type = TOKEN_TYPE_L_PAREN; 104 | input_pointer++; 105 | return mem; 106 | case ')': 107 | mem->val = current; 108 | mem->type = TOKEN_TYPE_R_PAREN; 109 | input_pointer++; 110 | return mem; 111 | case '0': 112 | case '1': 113 | case '2': 114 | case '3': 115 | case '4': 116 | case '5': 117 | case '6': 118 | case '7': 119 | case '8': 120 | case '9': 121 | mem->val = current; 122 | mem->type = TOKEN_TYPE_TERM; 123 | input_pointer++; 124 | return mem; 125 | case '+': 126 | case '-': 127 | mem->val = current; 128 | mem->precedence = 6; 129 | mem->associativity = LEFT_ASSOC; 130 | input_pointer++; 131 | return mem; 132 | case '*': 133 | case '/': 134 | case '%': 135 | mem->val = current; 136 | mem->precedence = 7; 137 | mem->associativity = LEFT_ASSOC; 138 | input_pointer++; 139 | return mem; 140 | case '^': 141 | mem->val = current; 142 | mem->precedence = 8; 143 | mem->associativity = RIGHT_ASSOC; 144 | input_pointer++; 145 | return mem; 146 | default: 147 | free(mem); 148 | printf("cannot parse token: %c\n", current); 149 | exit(EXIT_FAILURE); 150 | return NULL; 151 | } 152 | } 153 | 154 | static bool stack_has_opers(struct stack_obj * stck) { 155 | return stck != NULL; 156 | } 157 | 158 | static bool stack_oper_comes_before(struct stack_obj * op_stack, struct ASTNode * oper) { 159 | if (! stack_has_opers(op_stack)) { 160 | return false; 161 | } 162 | struct ASTNode * stack_head = stack_peek(op_stack); 163 | if (stack_head->type == TOKEN_TYPE_L_PAREN) { 164 | return false; 165 | } 166 | return (stack_head->precedence > oper->precedence) 167 | || (stack_head->precedence == oper->precedence && stack_head->associativity == LEFT_ASSOC); 168 | } 169 | 170 | static void shunting_yard_to_RPN(const char * const input) { 171 | // parse infix expression, write to stdout 172 | input_pointer = input; 173 | static struct stack_obj * oper_stack = NULL; // operators go here 174 | 175 | while (theres_more_input()) { 176 | struct ASTNode * token = parse_token(); 177 | switch (token->type) { 178 | case TOKEN_TYPE_TERM: 179 | putchar(token->val); 180 | break; 181 | case TOKEN_TYPE_OPERATOR: 182 | while (stack_oper_comes_before(oper_stack, token)) { 183 | putchar(stack_pop(&oper_stack)->val); 184 | } 185 | stack_push(&oper_stack, token); 186 | break; 187 | case TOKEN_TYPE_L_PAREN: 188 | stack_push(&oper_stack, token); 189 | break; 190 | case TOKEN_TYPE_R_PAREN: 191 | while (stack_has_opers(oper_stack) && stack_peek(oper_stack)->type != TOKEN_TYPE_L_PAREN) { 192 | putchar(stack_pop(&oper_stack)->val); 193 | } 194 | if (stack_has_opers(oper_stack) && stack_peek(oper_stack)->type == TOKEN_TYPE_L_PAREN) { 195 | stack_pop(&oper_stack); 196 | } else { 197 | error("mismatched parens"); 198 | } 199 | break; 200 | } 201 | } 202 | 203 | while (stack_has_opers(oper_stack)) { 204 | putchar(stack_pop(&oper_stack)->val); 205 | } 206 | putchar('\n'); 207 | } 208 | 209 | static struct ASTNode * parse_expression(const char * const input) { 210 | // shunting yard, returns a parse tree 211 | struct stack_obj * val_stack = NULL; // values go here 212 | struct stack_obj * oper_stack = NULL; // operators go here 213 | input_pointer = input; 214 | 215 | while (theres_more_input()) { 216 | struct ASTNode * token = parse_token(); 217 | switch (token->type) { 218 | case TOKEN_TYPE_TERM: 219 | stack_push(&val_stack, token); 220 | break; 221 | case TOKEN_TYPE_OPERATOR: 222 | while (stack_oper_comes_before(oper_stack, token)) { 223 | struct ASTNode * higher_prec_oper = stack_pop(&oper_stack); 224 | higher_prec_oper->children_right = stack_pop(&val_stack); 225 | higher_prec_oper->children_left = stack_pop(&val_stack); 226 | stack_push(&val_stack, higher_prec_oper); 227 | } 228 | stack_push(&oper_stack, token); 229 | break; 230 | case TOKEN_TYPE_L_PAREN: 231 | stack_push(&oper_stack, token); 232 | break; 233 | case TOKEN_TYPE_R_PAREN: 234 | while (stack_has_opers(oper_stack) && stack_peek(oper_stack)->type != TOKEN_TYPE_L_PAREN) { 235 | struct ASTNode * in_parens_oper = stack_pop(&oper_stack); 236 | in_parens_oper->children_right = stack_pop(&val_stack); 237 | in_parens_oper->children_left = stack_pop(&val_stack); 238 | stack_push(&val_stack, in_parens_oper); 239 | } 240 | if (stack_has_opers(oper_stack) && stack_peek(oper_stack)->type == TOKEN_TYPE_L_PAREN) { 241 | stack_pop(&oper_stack); 242 | } else { 243 | error("mismatched parens"); 244 | } 245 | break; 246 | } 247 | } 248 | 249 | while (stack_has_opers(oper_stack)) { 250 | struct ASTNode * oper = stack_pop(&oper_stack); 251 | oper->children_right = stack_pop(&val_stack); 252 | oper->children_left = stack_pop(&val_stack); 253 | stack_push(&val_stack, oper); 254 | } 255 | 256 | return val_stack->obj; 257 | } 258 | 259 | int main(int argc, char * argv[]) { 260 | if (argc < 2) { 261 | char input_buf[100]; 262 | fgets(input_buf, 100, stdin); 263 | shunting_yard_to_RPN(input_buf); 264 | } else { 265 | struct ASTNode * tree = parse_expression(argv[1]); 266 | pretty_print(tree); 267 | putchar('\n'); 268 | } 269 | } 270 | -------------------------------------------------------------------------------- /makefile: -------------------------------------------------------------------------------- 1 | SHELL := /bin/sh 2 | OUT_DIR := bin 3 | OUT_EXE := $(OUT_DIR)/hscalc 4 | CACHE := .cache 5 | HSFLAGS := -dynamic -j -O1 -fmax-errors=1 6 | GHCWARNS := -Wall -Wextra -Wmissing-exported-signatures -Widentities \ 7 | -Wpartial-fields -Wredundant-constraints 8 | GHCEXTS := -XOverloadedStrings -XLambdaCase -XStrict \ 9 | -XScopedTypeVariables -XImportQualifiedPost 10 | GHCFLAGS := -outputdir $(CACHE) $(GHCWARNS) $(GHCEXTS) $(HSFLAGS) 11 | 12 | .PHONY: default 13 | default: $(OUT_EXE) 14 | 15 | $(OUT_EXE): src/*.hs | $(OUT_DIR) $(CACHE) 16 | @echo ghc $(HSFLAGS) -o $@ src/*.hs 17 | @ghc $(GHCFLAGS) -o $@ src/*.hs 18 | 19 | $(OUT_DIR) $(CACHE): 20 | mkdir -p $@ 21 | 22 | .PHONY: clean 23 | clean: 24 | rm -fr $(OUT_DIR) $(CACHE) 25 | 26 | .PHONY: test 27 | test: $(OUT_EXE) 28 | @test/run_tests $(OUT_EXE) 29 | @echo "all tests passing! :^D" 30 | -------------------------------------------------------------------------------- /src/Main.hs: -------------------------------------------------------------------------------- 1 | module Main ( 2 | main 3 | ) where 4 | 5 | import Control.Monad (unless) 6 | import Control.Monad.Trans (liftIO) 7 | import Data.Char (isSpace) 8 | import Data.Functor ((<&>)) 9 | import Data.Function ((&)) 10 | import Data.Text qualified as Text (pack) 11 | import Data.Text.IO qualified as Text (getContents) 12 | import System.Console.Haskeline (runInputT, defaultSettings, getInputLine) 13 | import System.Environment (getArgs) 14 | import System.Exit (exitFailure, exitSuccess) 15 | 16 | import ShuntingYard 17 | 18 | main :: IO () 19 | main = do 20 | getArgs >>= \case 21 | [] -> repl 22 | ["-"] -> parse_stdin 23 | args -> parse_all args 24 | 25 | repl :: IO () 26 | repl = runInputT defaultSettings loop where 27 | loop = getInputLine "> " >>= \case 28 | Nothing -> pure () 29 | Just input -> liftIO (pep input) >> loop 30 | 31 | pep :: String -> IO () 32 | pep line = unless (all isSpace line) $ 33 | line & Text.pack & parse_eval_print 34 | 35 | parse_stdin :: IO () 36 | parse_stdin = Text.getContents 37 | <&> run_shunting_yard 38 | >>= \case 39 | Left err -> putStrLn (show err) 40 | >> exitFailure 41 | Right tree -> putStrLn (eval_show tree) 42 | >> exitSuccess 43 | 44 | parse_all :: [String] -> IO () 45 | parse_all exprs = mapM_ parse_eval_print (map Text.pack exprs) 46 | -------------------------------------------------------------------------------- /src/ShuntingYard.hs: -------------------------------------------------------------------------------- 1 | -- this is an infix expression parser. 2 | -- it can be extended to support operations with arbitrary precedence. 3 | -- it does not make any attempt at associativity, although this is possible. 4 | -- it gives higher precedence to operators which are not separated by spaces. 5 | 6 | module ShuntingYard ( 7 | pretty_show, 8 | run_shunting_yard, 9 | print_shunting_yard, 10 | evaluate, 11 | eval_show, 12 | parse_eval_print 13 | ) where 14 | 15 | import Control.Monad (when) 16 | import Data.Char (isSpace) -- for trim_spaces 17 | import Data.Fixed qualified as Fixed (mod') 18 | import Data.Functor (void, (<&>)) 19 | import Data.Function ((&)) 20 | import Data.Ratio (numerator, denominator) 21 | import Data.Text (Text) 22 | import Data.Text qualified as Text 23 | import Data.Text.Read qualified as Read (rational) 24 | import GHC.Float (fromRat) 25 | import Text.Parsec qualified as Parsec 26 | import Text.Parsec (Parsec, (<|>), ()) 27 | 28 | -- the oper stack is a temporary storage place for opers 29 | -- the tree stack holds the result, the output, as well as being used for 30 | -- intermediate storage 31 | -- ultimately the oper stack should be empty and the tree stack should contain 32 | -- only the complete expression tree 33 | 34 | newtype Precedence = Precedence Integer deriving (Eq, Ord) 35 | 36 | data TermToken = Term Rational 37 | | TightPreOp PrefixOperator 38 | | SpacedPreOp PrefixOperator 39 | | LParen 40 | 41 | data OperToken = Oper Operator 42 | | RParen 43 | | RParenAfterSpace 44 | deriving Show 45 | 46 | data ASTree = Branch Operator ASTree ASTree 47 | | Twig PrefixOperator ASTree 48 | | Leaf Rational 49 | deriving Show 50 | 51 | data StackOp = StackLParen 52 | | StackLParenFollowedBySpace 53 | | StackSpace 54 | | StackOp Operator 55 | | StackSpacedPreOp PrefixOperator 56 | | StackTightPreOp PrefixOperator 57 | deriving (Show, Eq) 58 | 59 | data Operator = Plus 60 | | Minus 61 | | Splat 62 | | Divide 63 | | FloorDiv 64 | | Modulo 65 | | Hihat 66 | deriving Eq 67 | 68 | data PrefixOperator = Negate 69 | | Explode 70 | deriving Eq 71 | 72 | newtype Oper_Stack = Oper_Stack [StackOp] deriving Show 73 | 74 | newtype Tree_Stack = Tree_Stack [ASTree] deriving Show 75 | 76 | newtype Tightness = Tight Bool deriving Eq 77 | 78 | type Stack_State = (Oper_Stack, Tree_Stack, Tightness) 79 | 80 | type CuteParser = Parsec Text Stack_State 81 | 82 | 83 | instance Show Operator where 84 | show = \case 85 | Plus -> "+" 86 | Minus -> "-" 87 | Splat -> "*" 88 | Divide -> "/" 89 | FloorDiv -> "//" 90 | Modulo -> "%" 91 | Hihat -> "^" 92 | 93 | pref_oper_to_char :: PrefixOperator -> Char 94 | pref_oper_to_char = \case 95 | Negate -> '~' 96 | Explode -> '!' 97 | 98 | instance Show PrefixOperator where 99 | show x = [pref_oper_to_char x] 100 | 101 | precedence :: Operator -> Precedence 102 | precedence = \case 103 | Plus -> Precedence 6 104 | Minus -> Precedence 6 105 | Splat -> Precedence 7 106 | Divide -> Precedence 7 107 | FloorDiv -> Precedence 7 108 | Modulo -> Precedence 7 109 | Hihat -> Precedence 8 110 | 111 | 112 | -- functions to get the current state 113 | get_op_stack :: CuteParser Oper_Stack 114 | get_op_stack = do 115 | (stack, _, _) <- Parsec.getState 116 | pure stack 117 | 118 | get_tree_stack :: CuteParser Tree_Stack 119 | get_tree_stack = do 120 | (_, stack, _) <- Parsec.getState 121 | pure stack 122 | 123 | get_tightness :: CuteParser Tightness 124 | get_tightness = do 125 | (_, _, tightness) <- Parsec.getState 126 | pure tightness 127 | 128 | -- functions to change or set the current state 129 | oper_stack_push :: StackOp -> CuteParser () 130 | oper_stack_push op = 131 | Parsec.modifyState (\(Oper_Stack ops, terms, b) -> (Oper_Stack (op:ops), terms, b)) 132 | 133 | oper_stack_set :: [StackOp] -> CuteParser () 134 | oper_stack_set tokes = Parsec.modifyState (\(_,s2,b) -> (Oper_Stack tokes, s2, b)) 135 | 136 | tree_stack_push :: ASTree -> CuteParser () 137 | tree_stack_push tree = 138 | Parsec.modifyState (\(ops, Tree_Stack vals, b) -> (ops, Tree_Stack (tree:vals), b)) 139 | 140 | tree_stack_pop :: CuteParser ASTree 141 | tree_stack_pop = do 142 | (opers, vals, b) <- Parsec.getState 143 | case vals of 144 | Tree_Stack (v:vs) -> do 145 | Parsec.setState (opers, Tree_Stack vs, b) 146 | pure v 147 | Tree_Stack _ -> Parsec.unexpected "?? did i expect a term?" 148 | 149 | set_spacing_tight :: Bool -> CuteParser () 150 | set_spacing_tight b = Parsec.modifyState (\(s1,s2,_) -> (s1, s2, Tight b)) 151 | 152 | -- functions that build the ASTree 153 | make_branch :: Operator -> [StackOp] -> CuteParser () 154 | make_branch op tokes = do 155 | r <- tree_stack_pop 156 | l <- tree_stack_pop 157 | tree_stack_push (Branch op l r) 158 | oper_stack_set tokes 159 | 160 | make_twig :: PrefixOperator -> [StackOp] -> CuteParser () 161 | make_twig op tokes = do 162 | tree <- tree_stack_pop 163 | tree_stack_push (Twig op tree) 164 | oper_stack_set tokes 165 | 166 | -- simple spacing-related parsers 167 | respect_spaces :: CuteParser () 168 | respect_spaces = Parsec.skipMany1 silent_space 169 | 170 | ignore_spaces :: CuteParser () 171 | ignore_spaces = Parsec.skipMany silent_space 172 | 173 | silent_space :: CuteParser Char 174 | silent_space = Parsec.char ' ' "" 175 | 176 | no_spaces :: String -> CuteParser () 177 | no_spaces failmsg = (Parsec.try silent_space *> Parsec.unexpected failmsg) 178 | <|> pure () 179 | 180 | if_loosely_spaced :: CuteParser () -> CuteParser () 181 | if_loosely_spaced action = do 182 | Tight spaced <- get_tightness 183 | when (not spaced) action 184 | 185 | if_tightly_spaced :: CuteParser () -> CuteParser () 186 | if_tightly_spaced action = do 187 | Tight spaced <- get_tightness 188 | when spaced action 189 | 190 | -- term parsers 191 | parse_num :: CuteParser TermToken 192 | parse_num = do 193 | integer <- Parsec.many1 Parsec.digit <&> Text.pack 194 | mantissa <- Parsec.option "" 195 | (Parsec.string "." <> Parsec.many1 Parsec.digit) 196 | <&> Text.pack 197 | case (integer <> mantissa) & Read.rational of 198 | Right (num, "") -> pure $ Term num 199 | -- these cases should be unreachable: 200 | -- `integer` can only contain digits; 201 | -- `mantissa` can only contain a dot then digits (or be empty) 202 | -- i can think of no reason why this should fail to parse. 203 | Right _ -> error "unreachable" 204 | Left _ -> error "unreachable" 205 | 206 | parse_prefix_op :: CuteParser TermToken 207 | parse_prefix_op = do 208 | oper <- parse_oper_symbol 209 | Parsec.optionMaybe respect_spaces >>= \case 210 | Nothing -> pure (TightPreOp oper) 211 | Just () -> pure (SpacedPreOp oper) 212 | where parse_oper_symbol = 213 | Parsec.char '!' *> pure Explode 214 | <|> Parsec.char '~' *> pure Negate 215 | "prefix operator" 216 | 217 | parse_left_paren :: CuteParser TermToken 218 | parse_left_paren = do 219 | void $ Parsec.lookAhead (Parsec.try parse_l) 220 | parse_l *> pure LParen 221 | where parse_l = ignore_spaces *> Parsec.char '(' 222 | 223 | -- oper parsers 224 | parse_infix_oper :: CuteParser OperToken 225 | parse_infix_oper = do 226 | Parsec.optionMaybe respect_spaces >>= \case 227 | Nothing -> do 228 | if_loosely_spaced (oper_stack_push StackSpace) 229 | set_spacing_tight True 230 | Just () -> do 231 | if_tightly_spaced find_left_space 232 | oper <- parse_oper_symbol 233 | if_loosely_spaced (respect_spaces "space after `" ++ show oper ++ "`") 234 | if_tightly_spaced $ no_spaces ("whitespace after `" ++ show oper ++ "`") 235 | pure (Oper oper) 236 | where 237 | parse_oper_symbol = 238 | Parsec.char '+' *> pure Plus 239 | <|> Parsec.char '-' *> pure Minus 240 | <|> Parsec.char '*' *> pure Splat 241 | <|> parse_floordiv *> pure FloorDiv -- must try this before Divide 242 | <|> Parsec.char '/' *> pure Divide 243 | <|> Parsec.char '%' *> pure Modulo 244 | <|> Parsec.char '^' *> pure Hihat 245 | "infix operator" 246 | parse_floordiv = Parsec.try (Parsec.string "//") 247 | 248 | parse_right_paren :: CuteParser OperToken 249 | parse_right_paren = do 250 | spacing <- Parsec.optionMaybe respect_spaces 251 | void $ Parsec.char ')' 252 | pure $ case spacing of 253 | Nothing -> RParen 254 | Just () -> RParenAfterSpace 255 | 256 | -- for finishing up at the end 257 | clean_stack :: CuteParser () 258 | clean_stack = do 259 | if_tightly_spaced find_left_space 260 | Oper_Stack op_stack <- get_op_stack 261 | case op_stack of 262 | [] -> pure () 263 | (StackTightPreOp op:tokes) -> do 264 | make_twig op tokes 265 | clean_stack 266 | (StackSpacedPreOp op:tokes) -> do 267 | make_twig op tokes 268 | clean_stack 269 | (StackOp op:tokes) -> do 270 | make_branch op tokes 271 | clean_stack 272 | _ -> Parsec.parserFail "incorrect whitespace or parens?" 273 | 274 | finish_expr :: CuteParser ASTree 275 | finish_expr = do 276 | ignore_spaces 277 | Parsec.optional Parsec.newline "" 278 | Parsec.eof "" 279 | clean_stack 280 | Tree_Stack tree <- get_tree_stack 281 | case tree of 282 | [] -> Parsec.parserFail "bad expression" 283 | (result:[]) -> pure result 284 | _ -> Parsec.parserFail "invalid expression, something is wrong here." 285 | 286 | apply_higher_prec_ops :: Precedence -> CuteParser () 287 | apply_higher_prec_ops current = do 288 | Oper_Stack op_stack <- get_op_stack 289 | case op_stack of 290 | [] -> pure () 291 | (tok:toks) -> case tok of 292 | StackSpace -> pure () 293 | StackLParen -> pure () 294 | StackLParenFollowedBySpace -> pure () 295 | StackTightPreOp _ -> do 296 | undefined -- can this case ever occur? 297 | -- make_twig op toks 298 | -- apply_higher_prec_ops current 299 | StackSpacedPreOp op -> do 300 | make_twig op toks 301 | apply_higher_prec_ops current 302 | StackOp op -> case (precedence op `compare` current) of 303 | LT -> pure () 304 | _ -> do 305 | make_branch op toks 306 | apply_higher_prec_ops current 307 | 308 | look_for :: StackOp -> CuteParser () 309 | look_for thing = do 310 | -- pop stuff off the oper_stack until you find `thing` 311 | Oper_Stack op_stack <- get_op_stack 312 | case op_stack of 313 | [] -> Parsec.unexpected "right paren" 314 | (tok:toks) -> case tok of 315 | t | t == thing -> oper_stack_set toks 316 | StackTightPreOp op -> do 317 | make_twig op toks 318 | look_for thing 319 | StackSpacedPreOp op -> do 320 | make_twig op toks 321 | look_for thing 322 | StackOp op -> do 323 | make_branch op toks 324 | look_for thing 325 | StackLParen -> 326 | Parsec.parserFail "incorrectly spaced parentheses" 327 | StackLParenFollowedBySpace -> 328 | Parsec.parserFail "incorrectly spaced parentheses" 329 | StackSpace -> 330 | Parsec.parserFail "incorrect spacing or parentheses" 331 | 332 | find_left_space :: CuteParser () 333 | find_left_space = look_for StackSpace *> set_spacing_tight False 334 | 335 | parse_term_token :: CuteParser TermToken 336 | parse_term_token = parse_num <|> parse_left_paren <|> parse_prefix_op 337 | 338 | check_for_oper :: CuteParser () 339 | check_for_oper = void 340 | $ Parsec.lookAhead 341 | $ Parsec.try 342 | $ ignore_spaces *> Parsec.oneOf valid_op_chars 343 | where valid_op_chars = "+-*/%^" 344 | 345 | apply_tight_prefix_opers :: CuteParser () 346 | apply_tight_prefix_opers = do 347 | Oper_Stack op_stack <- get_op_stack 348 | case op_stack of 349 | [] -> pure () 350 | (tok:toks) -> case tok of 351 | StackTightPreOp op -> do 352 | make_twig op toks 353 | apply_tight_prefix_opers 354 | _ -> pure () 355 | 356 | parse_oper_token :: CuteParser OperToken 357 | parse_oper_token = 358 | (check_for_oper *> apply_tight_prefix_opers *> parse_infix_oper) 359 | <|> parse_right_paren 360 | "infix operator" 361 | 362 | parse_term :: CuteParser ASTree 363 | parse_term = do 364 | -- shunting yard, returns a parse tree 365 | toke <- parse_term_token 366 | case toke of 367 | LParen -> do 368 | if_tightly_spaced (oper_stack_push StackSpace 369 | *> set_spacing_tight False) 370 | spacing <- Parsec.optionMaybe respect_spaces 371 | case spacing of 372 | Nothing -> oper_stack_push StackLParen 373 | Just _ -> oper_stack_push StackLParenFollowedBySpace 374 | parse_term 375 | Term t -> do 376 | tree_stack_push (Leaf t) 377 | parse_oper <|> finish_expr 378 | TightPreOp op -> do 379 | oper_stack_push (StackTightPreOp op) 380 | parse_term 381 | SpacedPreOp op -> do 382 | oper_stack_push (StackSpacedPreOp op) 383 | parse_term 384 | 385 | parse_oper :: CuteParser ASTree 386 | parse_oper = do 387 | parse_oper_token >>= \case 388 | RParen -> do 389 | if_tightly_spaced find_left_space 390 | look_for StackLParen 391 | Oper_Stack stack_ops <- get_op_stack 392 | case stack_ops of 393 | (StackSpace:ops) -> oper_stack_set ops *> set_spacing_tight True 394 | _ -> pure () 395 | parse_oper <|> finish_expr 396 | RParenAfterSpace -> do 397 | if_tightly_spaced find_left_space 398 | look_for StackLParenFollowedBySpace 399 | Oper_Stack stack_ops <- get_op_stack 400 | case stack_ops of 401 | (StackSpace:ops) -> oper_stack_set ops *> set_spacing_tight True 402 | _ -> pure () 403 | parse_oper <|> finish_expr 404 | Oper op -> do 405 | apply_higher_prec_ops (precedence op) 406 | oper_stack_push (StackOp op) 407 | parse_term 408 | 409 | -- these are little utilities, unrelated to parsing 410 | pretty_show :: ASTree -> String 411 | pretty_show (Branch oper left right) = concat ["(", show oper, " ", pretty_show left, " ", pretty_show right, ")"] 412 | pretty_show (Twig oper tree) = concat ["(", show oper, " ", pretty_show tree, ")"] 413 | pretty_show (Leaf val) = show val 414 | 415 | parse_expression :: CuteParser ASTree 416 | parse_expression = parse_term 417 | 418 | run_shunting_yard :: Text -> Either Parsec.ParseError ASTree 419 | run_shunting_yard input = Parsec.runParser 420 | parse_expression 421 | start_state 422 | name 423 | (trim_spaces input) 424 | where 425 | start_state = (Oper_Stack [], Tree_Stack [], Tight False) 426 | name = "" 427 | trim_spaces = Text.dropWhile isSpace <&> Text.dropWhileEnd isSpace 428 | 429 | print_shunting_yard :: Text -> IO () 430 | print_shunting_yard = run_shunting_yard <&> \case 431 | Left err -> putStrLn (show err) 432 | Right tree -> putStrLn (pretty_show tree) 433 | 434 | evaluate :: ASTree -> Rational 435 | evaluate (Leaf x) = x 436 | evaluate (Twig op tree) = operate (evaluate tree) 437 | where operate = case op of 438 | Negate -> negate 439 | Explode -> (\n -> product [1..n]) 440 | evaluate (Branch op left right) = evaluate left `operate` evaluate right 441 | where operate = case op of 442 | Plus -> (+) 443 | Minus -> (-) 444 | Splat -> (*) 445 | Divide -> (/) 446 | FloorDiv -> \x y -> (x/y) 447 | & floor 448 | & (toRational :: Integer -> Rational) 449 | Modulo -> Fixed.mod' 450 | -- uses floating-point exponents, unfortunately. 451 | Hihat -> \x y -> fromRat x ** fromRat y 452 | & (toRational :: Double -> Rational) 453 | 454 | 455 | eval_show :: ASTree -> String 456 | eval_show = evaluate <&> show_rational 457 | 458 | show_rational :: Rational -> String 459 | show_rational n = if denominator n == 1 460 | then show (numerator n) 461 | else show (fromRational n :: Double) 462 | 463 | parse_eval_print :: Text -> IO () 464 | parse_eval_print = run_shunting_yard <&> \case 465 | Left err -> putStrLn (show err) 466 | Right tree -> putStrLn (eval_show tree) 467 | -------------------------------------------------------------------------------- /test/exponents/arith1.txt: -------------------------------------------------------------------------------- 1 | 2 ^ 3 2 | 8 3 | -------------------------------------------------------------------------------- /test/exponents/arith2.txt: -------------------------------------------------------------------------------- 1 | 2^3 ^ 2 2 | 64 3 | -------------------------------------------------------------------------------- /test/exponents/arith3.txt: -------------------------------------------------------------------------------- 1 | 2 ^ 3^2 2 | 512 3 | -------------------------------------------------------------------------------- /test/exponents/arith4.txt: -------------------------------------------------------------------------------- 1 | 2.5 ^ 2.5 2 | 9.882117688026186 3 | -------------------------------------------------------------------------------- /test/exponents/arith5.txt: -------------------------------------------------------------------------------- 1 | 4 ^ ~1 2 | 0.25 3 | -------------------------------------------------------------------------------- /test/floordiv/arith1.txt: -------------------------------------------------------------------------------- 1 | 5 // 2 2 | 2 3 | -------------------------------------------------------------------------------- /test/floordiv/arith2.txt: -------------------------------------------------------------------------------- 1 | 11 // 3 2 | 3 3 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-parens1.txt: -------------------------------------------------------------------------------- 1 | (38 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-parens2.txt: -------------------------------------------------------------------------------- 1 | 33) 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-parens3.txt: -------------------------------------------------------------------------------- 1 | )( 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-parens4.txt: -------------------------------------------------------------------------------- 1 | (34 () 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-parens5.txt: -------------------------------------------------------------------------------- 1 | (48(34)) 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-prefix-op.txt: -------------------------------------------------------------------------------- 1 | ! 3+ 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-prefix-op2.txt: -------------------------------------------------------------------------------- 1 | ! +3 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-prefix-op3.txt: -------------------------------------------------------------------------------- 1 | !+ 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-prefix-op4.txt: -------------------------------------------------------------------------------- 1 | 5! 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-spaces1.txt: -------------------------------------------------------------------------------- 1 | 4+ 5 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-spaces2.txt: -------------------------------------------------------------------------------- 1 | 3 *2 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-spaces3.txt: -------------------------------------------------------------------------------- 1 | (3 + 3 ) 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-spaces4.txt: -------------------------------------------------------------------------------- 1 | ( (4 ) ) 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-spaces5.txt: -------------------------------------------------------------------------------- 1 | ( ( 5 )) 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-spaces6.txt: -------------------------------------------------------------------------------- 1 | (( 7 ) ) 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-terms1.txt: -------------------------------------------------------------------------------- 1 | a3d 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-terms2.txt: -------------------------------------------------------------------------------- 1 | 3d 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-terms3.txt: -------------------------------------------------------------------------------- 1 | 7d4 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/bad-terms4.txt: -------------------------------------------------------------------------------- 1 | 6e 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/missing-term1.txt: -------------------------------------------------------------------------------- 1 | 45+ 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/missing-term2.txt: -------------------------------------------------------------------------------- 1 | *37 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/missing-term3.txt: -------------------------------------------------------------------------------- 1 | 38+*4 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/missing-term4.txt: -------------------------------------------------------------------------------- 1 | 38 + * 499 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/missing-term5.txt: -------------------------------------------------------------------------------- 1 | () 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/missing-term6.txt: -------------------------------------------------------------------------------- 1 | ( ) 2 | -------------------------------------------------------------------------------- /test/new_failing_tests/missing-term7.txt: -------------------------------------------------------------------------------- 1 | ( ( ) 3 ) 2 | -------------------------------------------------------------------------------- /test/new_tests/arith1.txt: -------------------------------------------------------------------------------- 1 | 7*2+2*7 2 | 28 3 | -------------------------------------------------------------------------------- /test/new_tests/arith2.txt: -------------------------------------------------------------------------------- 1 | 3*4+(2*5)*4+(4-2*5*(2+5))-0-9+8*5 2 | 17 3 | -------------------------------------------------------------------------------- /test/new_tests/arith3.txt: -------------------------------------------------------------------------------- 1 | 2*(9-2*(9+4*(3+5)-2)+4*(4+2)) 2 | -90 3 | -------------------------------------------------------------------------------- /test/new_tests/arith4.txt: -------------------------------------------------------------------------------- 1 | 8-8-3*3+8-3*8-0*2+8-3*1+7-8*3+8+8*9+7-6-4+3*2-1+0*9 2 | 45 3 | -------------------------------------------------------------------------------- /test/new_tests/arith5.txt: -------------------------------------------------------------------------------- 1 | 8-8-3*3+(8-3)*8-(0)*(2+8)-3*(1+7-(8)*(3+8+(8*9)+7)-6-4)+(3)*2-1+(0*9) 2 | 2202 3 | -------------------------------------------------------------------------------- /test/new_tests/arith6.txt: -------------------------------------------------------------------------------- 1 | 8+2*(2+4)*2+4-3*9-(8*3+(2+4*7)+(2+4)) 2 | -51 3 | -------------------------------------------------------------------------------- /test/new_tests/arith7.txt: -------------------------------------------------------------------------------- 1 | ((3+4*2+1)+(8*2-3-5*8-(4))-8) 2 | -27 3 | -------------------------------------------------------------------------------- /test/new_tests/arith8.txt: -------------------------------------------------------------------------------- 1 | (((((4))))) 2 | 4 3 | -------------------------------------------------------------------------------- /test/new_tests/arith9.txt: -------------------------------------------------------------------------------- 1 | 1+(((((4)))-2))-1 2 | 2 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith1.txt: -------------------------------------------------------------------------------- 1 | (1+2) 2 | 3 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith10.txt: -------------------------------------------------------------------------------- 1 | 4+5 / 2+1 2 | 3 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith11.txt: -------------------------------------------------------------------------------- 1 | 4+5 / 3*1 2 | 3 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith12.txt: -------------------------------------------------------------------------------- 1 | 44+55 / 1+2*5 2 | 9 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith2.txt: -------------------------------------------------------------------------------- 1 | (1 + 2) 2 | 3 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith3.txt: -------------------------------------------------------------------------------- 1 | (1 + 2 * 3) 2 | 7 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith4.txt: -------------------------------------------------------------------------------- 1 | (1+2 * 3) 2 | 9 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith5.txt: -------------------------------------------------------------------------------- 1 | (1+2 * 3+4) 2 | 21 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith6.txt: -------------------------------------------------------------------------------- 1 | (1 + 2 * 3 + 4) 2 | 11 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith7.txt: -------------------------------------------------------------------------------- 1 | 2*(3+4) 2 | 14 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith8.txt: -------------------------------------------------------------------------------- 1 | 2*(3 + 5) 2 | 16 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith9.txt: -------------------------------------------------------------------------------- 1 | 2+3*(4 + 5) 2 | 29 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith_nested_parens1.txt: -------------------------------------------------------------------------------- 1 | ((2 + 3)*4) 2 | 20 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith_nested_parens2.txt: -------------------------------------------------------------------------------- 1 | ((2 + 3)*4 + 5) 2 | 25 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith_nested_parens3.txt: -------------------------------------------------------------------------------- 1 | ((1 + 2)*(3 + 4) - (5*6)) 2 | -9 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith_nested_parens4.txt: -------------------------------------------------------------------------------- 1 | (((1 + 2)+(3 + (4)) * ((5)-(6)))) 2 | -10 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith_nested_parens5.txt: -------------------------------------------------------------------------------- 1 | (((1 * 2)+(3 * 4))) 2 | 14 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith_nested_parens6.txt: -------------------------------------------------------------------------------- 1 | 1+(2*(3-(4*(5-6)))) 2 | 15 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith_nested_parens7.txt: -------------------------------------------------------------------------------- 1 | ( ( (3 + 5) ) ) 2 | 8 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith_nested_parens8.txt: -------------------------------------------------------------------------------- 1 | ( ( 15 ) ) 2 | 15 3 | -------------------------------------------------------------------------------- /test/new_whitespace_tests/arith_nested_parens9.txt: -------------------------------------------------------------------------------- 1 | 6*9 - ( 12 ) 2 | 42 3 | -------------------------------------------------------------------------------- /test/prefix_ops/bang.txt: -------------------------------------------------------------------------------- 1 | 3 + !4 2 | 27 3 | -------------------------------------------------------------------------------- /test/prefix_ops/bang2.txt: -------------------------------------------------------------------------------- 1 | (!3 + !2) 2 | 8 3 | -------------------------------------------------------------------------------- /test/prefix_ops/bang3.txt: -------------------------------------------------------------------------------- 1 | !3 - (!4 - !4) 2 | 6 3 | -------------------------------------------------------------------------------- /test/prefix_ops/bang4.txt: -------------------------------------------------------------------------------- 1 | !( 5 ) 2 | 120 3 | -------------------------------------------------------------------------------- /test/prefix_ops/bang5.txt: -------------------------------------------------------------------------------- 1 | !4 - 4 2 | 20 3 | -------------------------------------------------------------------------------- /test/prefix_ops/bang6.txt: -------------------------------------------------------------------------------- 1 | !4-4 2 | 20 3 | -------------------------------------------------------------------------------- /test/prefix_ops/bang7.txt: -------------------------------------------------------------------------------- 1 | !(4)-4 2 | 20 3 | -------------------------------------------------------------------------------- /test/prefix_ops/bang8.txt: -------------------------------------------------------------------------------- 1 | !(5-3) 2 | 2 3 | -------------------------------------------------------------------------------- /test/prefix_ops/long.txt: -------------------------------------------------------------------------------- 1 | 3+5 * 2+(~3) + !4-4 2 | 12 3 | -------------------------------------------------------------------------------- /test/prefix_ops/long2.txt: -------------------------------------------------------------------------------- 1 | ~~(~!(!!(5-2)-715)+125) 2 | 5 3 | -------------------------------------------------------------------------------- /test/prefix_ops/long3.txt: -------------------------------------------------------------------------------- 1 | 5 * !!!!2 * !!!!!2 + !!!!!2 2 | 22 3 | -------------------------------------------------------------------------------- /test/prefix_ops/negate.txt: -------------------------------------------------------------------------------- 1 | ~4 2 | -4 3 | -------------------------------------------------------------------------------- /test/prefix_ops/negate2.txt: -------------------------------------------------------------------------------- 1 | (5 + ~5) 2 | 0 3 | -------------------------------------------------------------------------------- /test/prefix_ops/negate3.txt: -------------------------------------------------------------------------------- 1 | ~(3+5) 2 | -8 3 | -------------------------------------------------------------------------------- /test/prefix_ops/negate4.txt: -------------------------------------------------------------------------------- 1 | ~~2 2 | 2 3 | -------------------------------------------------------------------------------- /test/prefix_ops/space.txt: -------------------------------------------------------------------------------- 1 | ~ 3 2 | -3 3 | -------------------------------------------------------------------------------- /test/prefix_ops/space2.txt: -------------------------------------------------------------------------------- 1 | ~ 2 + 2 2 | 0 3 | -------------------------------------------------------------------------------- /test/prefix_ops/space3.txt: -------------------------------------------------------------------------------- 1 | ~ 3+3 2 | -6 3 | -------------------------------------------------------------------------------- /test/prefix_ops/space4.txt: -------------------------------------------------------------------------------- 1 | ~ ! 3 2 | -6 3 | -------------------------------------------------------------------------------- /test/prefix_ops/space5.txt: -------------------------------------------------------------------------------- 1 | ~ 5-3 2 | -2 3 | -------------------------------------------------------------------------------- /test/prefix_ops/space6.txt: -------------------------------------------------------------------------------- 1 | ! 6-3 2 | 6 3 | -------------------------------------------------------------------------------- /test/prefix_ops/space7.txt: -------------------------------------------------------------------------------- 1 | !5-3 2 | 117 3 | -------------------------------------------------------------------------------- /test/prefix_ops/space8.txt: -------------------------------------------------------------------------------- 1 | !! 2 2 | 2 3 | -------------------------------------------------------------------------------- /test/prefix_ops/space9.txt: -------------------------------------------------------------------------------- 1 | ! !3 2 | 720 3 | -------------------------------------------------------------------------------- /test/rational/arith1.txt: -------------------------------------------------------------------------------- 1 | 5 / 2 2 | 2.5 3 | -------------------------------------------------------------------------------- /test/rational/arith2.txt: -------------------------------------------------------------------------------- 1 | 1/3 2 | 0.3333333333333333 3 | -------------------------------------------------------------------------------- /test/rational/arith3.txt: -------------------------------------------------------------------------------- 1 | 1/3 / 1/3 2 | 1 3 | -------------------------------------------------------------------------------- /test/rational/arith4.txt: -------------------------------------------------------------------------------- 1 | 2.5 % 2 2 | 0.5 3 | -------------------------------------------------------------------------------- /test/rational/arith5.txt: -------------------------------------------------------------------------------- 1 | 3.5 % 2.5 2 | 1 3 | -------------------------------------------------------------------------------- /test/run_tests: -------------------------------------------------------------------------------- 1 | #!/usr/bin/dash 2 | 3 | out_exe="$1" 4 | 5 | run_cmd_in_subdir() { 6 | local cmd="$1" 7 | local subdir="$2" 8 | 9 | for fi in $(ls -t -r "$subdir"); do 10 | fullname="$subdir/$fi" 11 | echo -n "testing $cmd on ${subdir}/${fi}... " 12 | 13 | input=$(head -n 1 "$fullname") 14 | result=$("$cmd" "$input") 15 | correct_result=$(tail -n 1 "$fullname") 16 | 17 | if [ "$result" = "$correct_result" ]; then 18 | echo "OK." 19 | continue 20 | else 21 | echo "FAILED TEST:" 22 | echo "\tinput: $input" 23 | echo "\tresult: \t$result" 24 | echo "\tcorrect result: $correct_result" 25 | exit 1 26 | fi 27 | done 28 | } 29 | 30 | run_failing_cmd_in_subdir() { 31 | local cmd="$1" 32 | local subdir="$2" 33 | 34 | for fi in $(ls -t -r "$subdir"); do 35 | fullname="$subdir/$fi" 36 | echo -n "testing $cmd - < $fullname ..." 37 | "$cmd" '-' < "$fullname" > /dev/null && exit 1 38 | echo " OK." 39 | done 40 | 41 | } 42 | 43 | main() { 44 | echo "=== testing expression parser... " 45 | 46 | run_cmd_in_subdir "$out_exe" "test/tests" 47 | run_cmd_in_subdir "$out_exe" "test/new_tests" 48 | run_cmd_in_subdir "$out_exe" "test/whitespace_tests/" 49 | run_cmd_in_subdir "$out_exe" "test/whitespace_free_tests/" 50 | run_cmd_in_subdir "$out_exe" "test/new_whitespace_tests" 51 | run_cmd_in_subdir "$out_exe" "test/prefix_ops" 52 | run_cmd_in_subdir "$out_exe" "test/rational" 53 | run_cmd_in_subdir "$out_exe" "test/exponents" 54 | echo "=== all expression parser tests passed :^)" 55 | 56 | echo "=== now checking invalid inputs..." 57 | run_failing_cmd_in_subdir "$out_exe" "test/new_failing_tests" 58 | echo "=== all bad tests failed :^)" 59 | } 60 | 61 | main 62 | -------------------------------------------------------------------------------- /test/tests/add.txt: -------------------------------------------------------------------------------- 1 | 1+2 2 | 3 3 | -------------------------------------------------------------------------------- /test/tests/add2.txt: -------------------------------------------------------------------------------- 1 | 1+2+3 2 | 6 3 | -------------------------------------------------------------------------------- /test/tests/add3.txt: -------------------------------------------------------------------------------- 1 | 1+2+3+4 2 | 10 3 | -------------------------------------------------------------------------------- /test/tests/add4.txt: -------------------------------------------------------------------------------- 1 | 1+2+3+4+5 2 | 15 3 | -------------------------------------------------------------------------------- /test/tests/long.txt: -------------------------------------------------------------------------------- 1 | 1+2*3+4+5+6*7*8+9 2 | 361 3 | -------------------------------------------------------------------------------- /test/tests/mult.txt: -------------------------------------------------------------------------------- 1 | 2*3 2 | 6 3 | -------------------------------------------------------------------------------- /test/tests/mult2.txt: -------------------------------------------------------------------------------- 1 | 3*4*5 2 | 60 3 | -------------------------------------------------------------------------------- /test/tests/parens.txt: -------------------------------------------------------------------------------- 1 | 1+(2*3) 2 | 7 3 | -------------------------------------------------------------------------------- /test/tests/parens2.txt: -------------------------------------------------------------------------------- 1 | (1+2)*3 2 | 9 3 | -------------------------------------------------------------------------------- /test/tests/parens3.txt: -------------------------------------------------------------------------------- 1 | 1*2*(3+4)+5 2 | 19 3 | -------------------------------------------------------------------------------- /test/whitespace_free_tests/arith1.txt: -------------------------------------------------------------------------------- 1 | 1 + 3 2 | 4 3 | -------------------------------------------------------------------------------- /test/whitespace_free_tests/arith2.txt: -------------------------------------------------------------------------------- 1 | 3 * 5 2 | 15 3 | -------------------------------------------------------------------------------- /test/whitespace_free_tests/arith3.txt: -------------------------------------------------------------------------------- 1 | 2 - 5 2 | -3 3 | -------------------------------------------------------------------------------- /test/whitespace_free_tests/arith4.txt: -------------------------------------------------------------------------------- 1 | (1 + 4) * (7 - 3) 2 | 20 3 | -------------------------------------------------------------------------------- /test/whitespace_free_tests/arith5.txt: -------------------------------------------------------------------------------- 1 | 9 * 3 + 5 * 2 2 | 37 3 | -------------------------------------------------------------------------------- /test/whitespace_free_tests/arith6.txt: -------------------------------------------------------------------------------- 1 | 1 + 2 * 3 + 4 * 5 + 6 * 7 + 8 * 9 2 | 141 3 | -------------------------------------------------------------------------------- /test/whitespace_free_tests/arith7.txt: -------------------------------------------------------------------------------- 1 | 1 + 2 * 3 + 4 * (5 + 6 * (7 + 8) * 9) 2 | 3267 3 | -------------------------------------------------------------------------------- /test/whitespace_tests/whitespace.txt: -------------------------------------------------------------------------------- 1 | 1+2 * 3 2 | 9 3 | -------------------------------------------------------------------------------- /test/whitespace_tests/whitespace2.txt: -------------------------------------------------------------------------------- 1 | 1+2 * 3+4 2 | 21 3 | -------------------------------------------------------------------------------- /test/whitespace_tests/whitespace3.txt: -------------------------------------------------------------------------------- 1 | 1+2 * 3+4 * 5+6 2 | 231 3 | -------------------------------------------------------------------------------- /test/whitespace_tests/whitespace4.txt: -------------------------------------------------------------------------------- 1 | 1*2 + 3*4 + 5*6 2 | 44 3 | -------------------------------------------------------------------------------- /test/whitespace_tests/whitespace5.txt: -------------------------------------------------------------------------------- 1 | 1*2*3 + 4*5*6 2 | 126 3 | --------------------------------------------------------------------------------