├── .gitignore ├── .gitmodules ├── LICENSE ├── README.md └── src ├── ast.cc ├── ast.hh ├── encoding.hh ├── error.cc ├── error.hh ├── evaluator.cc ├── evaluator.hh ├── parser.cc ├── parser.hh ├── preprocessor.cc ├── preprocessor.hh ├── scanner.cc ├── scanner.hh ├── token.cc ├── token.hh ├── type.cc └── type.hh /.gitignore: -------------------------------------------------------------------------------- 1 | # macOS Desktop Services Store 2 | .DS_Store 3 | 4 | # Temporary files 5 | *~ 6 | 7 | # Vim swap files 8 | .*.sw? 9 | 10 | # Auto-generated tag files 11 | tags 12 | -------------------------------------------------------------------------------- /.gitmodules: -------------------------------------------------------------------------------- 1 | [submodule "tests"] 2 | path = tests 3 | url = https://github.com/a7vinx/axcc-tests.git 4 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | Copyright (C) 2007 Free Software Foundation, Inc. 4 | Everyone is permitted to copy and distribute verbatim copies 5 | of this license document, but changing it is not allowed. 6 | 7 | Preamble 8 | 9 | The GNU General Public License is a free, copyleft license for 10 | software and other kinds of works. 11 | 12 | The licenses for most software and other practical works are designed 13 | to take away your freedom to share and change the works. By contrast, 14 | the GNU General Public License is intended to guarantee your freedom to 15 | share and change all versions of a program--to make sure it remains free 16 | software for all its users. We, the Free Software Foundation, use the 17 | GNU General Public License for most of our software; it applies also to 18 | any other work released this way by its authors. You can apply it to 19 | your programs, too. 20 | 21 | When we speak of free software, we are referring to freedom, not 22 | price. Our General Public Licenses are designed to make sure that you 23 | have the freedom to distribute copies of free software (and charge for 24 | them if you wish), that you receive source code or can get it if you 25 | want it, that you can change the software or use pieces of it in new 26 | free programs, and that you know you can do these things. 27 | 28 | To protect your rights, we need to prevent others from denying you 29 | these rights or asking you to surrender the rights. Therefore, you have 30 | certain responsibilities if you distribute copies of the software, or if 31 | you modify it: responsibilities to respect the freedom of others. 32 | 33 | For example, if you distribute copies of such a program, whether 34 | gratis or for a fee, you must pass on to the recipients the same 35 | freedoms that you received. You must make sure that they, too, receive 36 | or can get the source code. And you must show them these terms so they 37 | know their rights. 38 | 39 | Developers that use the GNU GPL protect your rights with two steps: 40 | (1) assert copyright on the software, and (2) offer you this License 41 | giving you legal permission to copy, distribute and/or modify it. 42 | 43 | For the developers' and authors' protection, the GPL clearly explains 44 | that there is no warranty for this free software. For both users' and 45 | authors' sake, the GPL requires that modified versions be marked as 46 | changed, so that their problems will not be attributed erroneously to 47 | authors of previous versions. 48 | 49 | Some devices are designed to deny users access to install or run 50 | modified versions of the software inside them, although the manufacturer 51 | can do so. This is fundamentally incompatible with the aim of 52 | protecting users' freedom to change the software. The systematic 53 | pattern of such abuse occurs in the area of products for individuals to 54 | use, which is precisely where it is most unacceptable. Therefore, we 55 | have designed this version of the GPL to prohibit the practice for those 56 | products. If such problems arise substantially in other domains, we 57 | stand ready to extend this provision to those domains in future versions 58 | of the GPL, as needed to protect the freedom of users. 59 | 60 | Finally, every program is threatened constantly by software patents. 61 | States should not allow patents to restrict development and use of 62 | software on general-purpose computers, but in those that do, we wish to 63 | avoid the special danger that patents applied to a free program could 64 | make it effectively proprietary. To prevent this, the GPL assures that 65 | patents cannot be used to render the program non-free. 66 | 67 | The precise terms and conditions for copying, distribution and 68 | modification follow. 69 | 70 | TERMS AND CONDITIONS 71 | 72 | 0. Definitions. 73 | 74 | "This License" refers to version 3 of the GNU General Public License. 75 | 76 | "Copyright" also means copyright-like laws that apply to other kinds of 77 | works, such as semiconductor masks. 78 | 79 | "The Program" refers to any copyrightable work licensed under this 80 | License. Each licensee is addressed as "you". "Licensees" and 81 | "recipients" may be individuals or organizations. 82 | 83 | To "modify" a work means to copy from or adapt all or part of the work 84 | in a fashion requiring copyright permission, other than the making of an 85 | exact copy. The resulting work is called a "modified version" of the 86 | earlier work or a work "based on" the earlier work. 87 | 88 | A "covered work" means either the unmodified Program or a work based 89 | on the Program. 90 | 91 | To "propagate" a work means to do anything with it that, without 92 | permission, would make you directly or secondarily liable for 93 | infringement under applicable copyright law, except executing it on a 94 | computer or modifying a private copy. Propagation includes copying, 95 | distribution (with or without modification), making available to the 96 | public, and in some countries other activities as well. 97 | 98 | To "convey" a work means any kind of propagation that enables other 99 | parties to make or receive copies. Mere interaction with a user through 100 | a computer network, with no transfer of a copy, is not conveying. 101 | 102 | An interactive user interface displays "Appropriate Legal Notices" 103 | to the extent that it includes a convenient and prominently visible 104 | feature that (1) displays an appropriate copyright notice, and (2) 105 | tells the user that there is no warranty for the work (except to the 106 | extent that warranties are provided), that licensees may convey the 107 | work under this License, and how to view a copy of this License. If 108 | the interface presents a list of user commands or options, such as a 109 | menu, a prominent item in the list meets this criterion. 110 | 111 | 1. Source Code. 112 | 113 | The "source code" for a work means the preferred form of the work 114 | for making modifications to it. "Object code" means any non-source 115 | form of a work. 116 | 117 | A "Standard Interface" means an interface that either is an official 118 | standard defined by a recognized standards body, or, in the case of 119 | interfaces specified for a particular programming language, one that 120 | is widely used among developers working in that language. 121 | 122 | The "System Libraries" of an executable work include anything, other 123 | than the work as a whole, that (a) is included in the normal form of 124 | packaging a Major Component, but which is not part of that Major 125 | Component, and (b) serves only to enable use of the work with that 126 | Major Component, or to implement a Standard Interface for which an 127 | implementation is available to the public in source code form. A 128 | "Major Component", in this context, means a major essential component 129 | (kernel, window system, and so on) of the specific operating system 130 | (if any) on which the executable work runs, or a compiler used to 131 | produce the work, or an object code interpreter used to run it. 132 | 133 | The "Corresponding Source" for a work in object code form means all 134 | the source code needed to generate, install, and (for an executable 135 | work) run the object code and to modify the work, including scripts to 136 | control those activities. However, it does not include the work's 137 | System Libraries, or general-purpose tools or generally available free 138 | programs which are used unmodified in performing those activities but 139 | which are not part of the work. For example, Corresponding Source 140 | includes interface definition files associated with source files for 141 | the work, and the source code for shared libraries and dynamically 142 | linked subprograms that the work is specifically designed to require, 143 | such as by intimate data communication or control flow between those 144 | subprograms and other parts of the work. 145 | 146 | The Corresponding Source need not include anything that users 147 | can regenerate automatically from other parts of the Corresponding 148 | Source. 149 | 150 | The Corresponding Source for a work in source code form is that 151 | same work. 152 | 153 | 2. Basic Permissions. 154 | 155 | All rights granted under this License are granted for the term of 156 | copyright on the Program, and are irrevocable provided the stated 157 | conditions are met. This License explicitly affirms your unlimited 158 | permission to run the unmodified Program. The output from running a 159 | covered work is covered by this License only if the output, given its 160 | content, constitutes a covered work. This License acknowledges your 161 | rights of fair use or other equivalent, as provided by copyright law. 162 | 163 | You may make, run and propagate covered works that you do not 164 | convey, without conditions so long as your license otherwise remains 165 | in force. You may convey covered works to others for the sole purpose 166 | of having them make modifications exclusively for you, or provide you 167 | with facilities for running those works, provided that you comply with 168 | the terms of this License in conveying all material for which you do 169 | not control copyright. Those thus making or running the covered works 170 | for you must do so exclusively on your behalf, under your direction 171 | and control, on terms that prohibit them from making any copies of 172 | your copyrighted material outside their relationship with you. 173 | 174 | Conveying under any other circumstances is permitted solely under 175 | the conditions stated below. Sublicensing is not allowed; section 10 176 | makes it unnecessary. 177 | 178 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 179 | 180 | No covered work shall be deemed part of an effective technological 181 | measure under any applicable law fulfilling obligations under article 182 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 183 | similar laws prohibiting or restricting circumvention of such 184 | measures. 185 | 186 | When you convey a covered work, you waive any legal power to forbid 187 | circumvention of technological measures to the extent such circumvention 188 | is effected by exercising rights under this License with respect to 189 | the covered work, and you disclaim any intention to limit operation or 190 | modification of the work as a means of enforcing, against the work's 191 | users, your or third parties' legal rights to forbid circumvention of 192 | technological measures. 193 | 194 | 4. Conveying Verbatim Copies. 195 | 196 | You may convey verbatim copies of the Program's source code as you 197 | receive it, in any medium, provided that you conspicuously and 198 | appropriately publish on each copy an appropriate copyright notice; 199 | keep intact all notices stating that this License and any 200 | non-permissive terms added in accord with section 7 apply to the code; 201 | keep intact all notices of the absence of any warranty; and give all 202 | recipients a copy of this License along with the Program. 203 | 204 | You may charge any price or no price for each copy that you convey, 205 | and you may offer support or warranty protection for a fee. 206 | 207 | 5. Conveying Modified Source Versions. 208 | 209 | You may convey a work based on the Program, or the modifications to 210 | produce it from the Program, in the form of source code under the 211 | terms of section 4, provided that you also meet all of these conditions: 212 | 213 | a) The work must carry prominent notices stating that you modified 214 | it, and giving a relevant date. 215 | 216 | b) The work must carry prominent notices stating that it is 217 | released under this License and any conditions added under section 218 | 7. This requirement modifies the requirement in section 4 to 219 | "keep intact all notices". 220 | 221 | c) You must license the entire work, as a whole, under this 222 | License to anyone who comes into possession of a copy. This 223 | License will therefore apply, along with any applicable section 7 224 | additional terms, to the whole of the work, and all its parts, 225 | regardless of how they are packaged. This License gives no 226 | permission to license the work in any other way, but it does not 227 | invalidate such permission if you have separately received it. 228 | 229 | d) If the work has interactive user interfaces, each must display 230 | Appropriate Legal Notices; however, if the Program has interactive 231 | interfaces that do not display Appropriate Legal Notices, your 232 | work need not make them do so. 233 | 234 | A compilation of a covered work with other separate and independent 235 | works, which are not by their nature extensions of the covered work, 236 | and which are not combined with it such as to form a larger program, 237 | in or on a volume of a storage or distribution medium, is called an 238 | "aggregate" if the compilation and its resulting copyright are not 239 | used to limit the access or legal rights of the compilation's users 240 | beyond what the individual works permit. Inclusion of a covered work 241 | in an aggregate does not cause this License to apply to the other 242 | parts of the aggregate. 243 | 244 | 6. Conveying Non-Source Forms. 245 | 246 | You may convey a covered work in object code form under the terms 247 | of sections 4 and 5, provided that you also convey the 248 | machine-readable Corresponding Source under the terms of this License, 249 | in one of these ways: 250 | 251 | a) Convey the object code in, or embodied in, a physical product 252 | (including a physical distribution medium), accompanied by the 253 | Corresponding Source fixed on a durable physical medium 254 | customarily used for software interchange. 255 | 256 | b) Convey the object code in, or embodied in, a physical product 257 | (including a physical distribution medium), accompanied by a 258 | written offer, valid for at least three years and valid for as 259 | long as you offer spare parts or customer support for that product 260 | model, to give anyone who possesses the object code either (1) a 261 | copy of the Corresponding Source for all the software in the 262 | product that is covered by this License, on a durable physical 263 | medium customarily used for software interchange, for a price no 264 | more than your reasonable cost of physically performing this 265 | conveying of source, or (2) access to copy the 266 | Corresponding Source from a network server at no charge. 267 | 268 | c) Convey individual copies of the object code with a copy of the 269 | written offer to provide the Corresponding Source. This 270 | alternative is allowed only occasionally and noncommercially, and 271 | only if you received the object code with such an offer, in accord 272 | with subsection 6b. 273 | 274 | d) Convey the object code by offering access from a designated 275 | place (gratis or for a charge), and offer equivalent access to the 276 | Corresponding Source in the same way through the same place at no 277 | further charge. You need not require recipients to copy the 278 | Corresponding Source along with the object code. If the place to 279 | copy the object code is a network server, the Corresponding Source 280 | may be on a different server (operated by you or a third party) 281 | that supports equivalent copying facilities, provided you maintain 282 | clear directions next to the object code saying where to find the 283 | Corresponding Source. Regardless of what server hosts the 284 | Corresponding Source, you remain obligated to ensure that it is 285 | available for as long as needed to satisfy these requirements. 286 | 287 | e) Convey the object code using peer-to-peer transmission, provided 288 | you inform other peers where the object code and Corresponding 289 | Source of the work are being offered to the general public at no 290 | charge under subsection 6d. 291 | 292 | A separable portion of the object code, whose source code is excluded 293 | from the Corresponding Source as a System Library, need not be 294 | included in conveying the object code work. 295 | 296 | A "User Product" is either (1) a "consumer product", which means any 297 | tangible personal property which is normally used for personal, family, 298 | or household purposes, or (2) anything designed or sold for incorporation 299 | into a dwelling. In determining whether a product is a consumer product, 300 | doubtful cases shall be resolved in favor of coverage. For a particular 301 | product received by a particular user, "normally used" refers to a 302 | typical or common use of that class of product, regardless of the status 303 | of the particular user or of the way in which the particular user 304 | actually uses, or expects or is expected to use, the product. A product 305 | is a consumer product regardless of whether the product has substantial 306 | commercial, industrial or non-consumer uses, unless such uses represent 307 | the only significant mode of use of the product. 308 | 309 | "Installation Information" for a User Product means any methods, 310 | procedures, authorization keys, or other information required to install 311 | and execute modified versions of a covered work in that User Product from 312 | a modified version of its Corresponding Source. The information must 313 | suffice to ensure that the continued functioning of the modified object 314 | code is in no case prevented or interfered with solely because 315 | modification has been made. 316 | 317 | If you convey an object code work under this section in, or with, or 318 | specifically for use in, a User Product, and the conveying occurs as 319 | part of a transaction in which the right of possession and use of the 320 | User Product is transferred to the recipient in perpetuity or for a 321 | fixed term (regardless of how the transaction is characterized), the 322 | Corresponding Source conveyed under this section must be accompanied 323 | by the Installation Information. But this requirement does not apply 324 | if neither you nor any third party retains the ability to install 325 | modified object code on the User Product (for example, the work has 326 | been installed in ROM). 327 | 328 | The requirement to provide Installation Information does not include a 329 | requirement to continue to provide support service, warranty, or updates 330 | for a work that has been modified or installed by the recipient, or for 331 | the User Product in which it has been modified or installed. Access to a 332 | network may be denied when the modification itself materially and 333 | adversely affects the operation of the network or violates the rules and 334 | protocols for communication across the network. 335 | 336 | Corresponding Source conveyed, and Installation Information provided, 337 | in accord with this section must be in a format that is publicly 338 | documented (and with an implementation available to the public in 339 | source code form), and must require no special password or key for 340 | unpacking, reading or copying. 341 | 342 | 7. Additional Terms. 343 | 344 | "Additional permissions" are terms that supplement the terms of this 345 | License by making exceptions from one or more of its conditions. 346 | Additional permissions that are applicable to the entire Program shall 347 | be treated as though they were included in this License, to the extent 348 | that they are valid under applicable law. If additional permissions 349 | apply only to part of the Program, that part may be used separately 350 | under those permissions, but the entire Program remains governed by 351 | this License without regard to the additional permissions. 352 | 353 | When you convey a copy of a covered work, you may at your option 354 | remove any additional permissions from that copy, or from any part of 355 | it. (Additional permissions may be written to require their own 356 | removal in certain cases when you modify the work.) You may place 357 | additional permissions on material, added by you to a covered work, 358 | for which you have or can give appropriate copyright permission. 359 | 360 | Notwithstanding any other provision of this License, for material you 361 | add to a covered work, you may (if authorized by the copyright holders of 362 | that material) supplement the terms of this License with terms: 363 | 364 | a) Disclaiming warranty or limiting liability differently from the 365 | terms of sections 15 and 16 of this License; or 366 | 367 | b) Requiring preservation of specified reasonable legal notices or 368 | author attributions in that material or in the Appropriate Legal 369 | Notices displayed by works containing it; or 370 | 371 | c) Prohibiting misrepresentation of the origin of that material, or 372 | requiring that modified versions of such material be marked in 373 | reasonable ways as different from the original version; or 374 | 375 | d) Limiting the use for publicity purposes of names of licensors or 376 | authors of the material; or 377 | 378 | e) Declining to grant rights under trademark law for use of some 379 | trade names, trademarks, or service marks; or 380 | 381 | f) Requiring indemnification of licensors and authors of that 382 | material by anyone who conveys the material (or modified versions of 383 | it) with contractual assumptions of liability to the recipient, for 384 | any liability that these contractual assumptions directly impose on 385 | those licensors and authors. 386 | 387 | All other non-permissive additional terms are considered "further 388 | restrictions" within the meaning of section 10. If the Program as you 389 | received it, or any part of it, contains a notice stating that it is 390 | governed by this License along with a term that is a further 391 | restriction, you may remove that term. If a license document contains 392 | a further restriction but permits relicensing or conveying under this 393 | License, you may add to a covered work material governed by the terms 394 | of that license document, provided that the further restriction does 395 | not survive such relicensing or conveying. 396 | 397 | If you add terms to a covered work in accord with this section, you 398 | must place, in the relevant source files, a statement of the 399 | additional terms that apply to those files, or a notice indicating 400 | where to find the applicable terms. 401 | 402 | Additional terms, permissive or non-permissive, may be stated in the 403 | form of a separately written license, or stated as exceptions; 404 | the above requirements apply either way. 405 | 406 | 8. Termination. 407 | 408 | You may not propagate or modify a covered work except as expressly 409 | provided under this License. Any attempt otherwise to propagate or 410 | modify it is void, and will automatically terminate your rights under 411 | this License (including any patent licenses granted under the third 412 | paragraph of section 11). 413 | 414 | However, if you cease all violation of this License, then your 415 | license from a particular copyright holder is reinstated (a) 416 | provisionally, unless and until the copyright holder explicitly and 417 | finally terminates your license, and (b) permanently, if the copyright 418 | holder fails to notify you of the violation by some reasonable means 419 | prior to 60 days after the cessation. 420 | 421 | Moreover, your license from a particular copyright holder is 422 | reinstated permanently if the copyright holder notifies you of the 423 | violation by some reasonable means, this is the first time you have 424 | received notice of violation of this License (for any work) from that 425 | copyright holder, and you cure the violation prior to 30 days after 426 | your receipt of the notice. 427 | 428 | Termination of your rights under this section does not terminate the 429 | licenses of parties who have received copies or rights from you under 430 | this License. If your rights have been terminated and not permanently 431 | reinstated, you do not qualify to receive new licenses for the same 432 | material under section 10. 433 | 434 | 9. Acceptance Not Required for Having Copies. 435 | 436 | You are not required to accept this License in order to receive or 437 | run a copy of the Program. Ancillary propagation of a covered work 438 | occurring solely as a consequence of using peer-to-peer transmission 439 | to receive a copy likewise does not require acceptance. However, 440 | nothing other than this License grants you permission to propagate or 441 | modify any covered work. These actions infringe copyright if you do 442 | not accept this License. Therefore, by modifying or propagating a 443 | covered work, you indicate your acceptance of this License to do so. 444 | 445 | 10. Automatic Licensing of Downstream Recipients. 446 | 447 | Each time you convey a covered work, the recipient automatically 448 | receives a license from the original licensors, to run, modify and 449 | propagate that work, subject to this License. You are not responsible 450 | for enforcing compliance by third parties with this License. 451 | 452 | An "entity transaction" is a transaction transferring control of an 453 | organization, or substantially all assets of one, or subdividing an 454 | organization, or merging organizations. If propagation of a covered 455 | work results from an entity transaction, each party to that 456 | transaction who receives a copy of the work also receives whatever 457 | licenses to the work the party's predecessor in interest had or could 458 | give under the previous paragraph, plus a right to possession of the 459 | Corresponding Source of the work from the predecessor in interest, if 460 | the predecessor has it or can get it with reasonable efforts. 461 | 462 | You may not impose any further restrictions on the exercise of the 463 | rights granted or affirmed under this License. For example, you may 464 | not impose a license fee, royalty, or other charge for exercise of 465 | rights granted under this License, and you may not initiate litigation 466 | (including a cross-claim or counterclaim in a lawsuit) alleging that 467 | any patent claim is infringed by making, using, selling, offering for 468 | sale, or importing the Program or any portion of it. 469 | 470 | 11. Patents. 471 | 472 | A "contributor" is a copyright holder who authorizes use under this 473 | License of the Program or a work on which the Program is based. The 474 | work thus licensed is called the contributor's "contributor version". 475 | 476 | A contributor's "essential patent claims" are all patent claims 477 | owned or controlled by the contributor, whether already acquired or 478 | hereafter acquired, that would be infringed by some manner, permitted 479 | by this License, of making, using, or selling its contributor version, 480 | but do not include claims that would be infringed only as a 481 | consequence of further modification of the contributor version. For 482 | purposes of this definition, "control" includes the right to grant 483 | patent sublicenses in a manner consistent with the requirements of 484 | this License. 485 | 486 | Each contributor grants you a non-exclusive, worldwide, royalty-free 487 | patent license under the contributor's essential patent claims, to 488 | make, use, sell, offer for sale, import and otherwise run, modify and 489 | propagate the contents of its contributor version. 490 | 491 | In the following three paragraphs, a "patent license" is any express 492 | agreement or commitment, however denominated, not to enforce a patent 493 | (such as an express permission to practice a patent or covenant not to 494 | sue for patent infringement). To "grant" such a patent license to a 495 | party means to make such an agreement or commitment not to enforce a 496 | patent against the party. 497 | 498 | If you convey a covered work, knowingly relying on a patent license, 499 | and the Corresponding Source of the work is not available for anyone 500 | to copy, free of charge and under the terms of this License, through a 501 | publicly available network server or other readily accessible means, 502 | then you must either (1) cause the Corresponding Source to be so 503 | available, or (2) arrange to deprive yourself of the benefit of the 504 | patent license for this particular work, or (3) arrange, in a manner 505 | consistent with the requirements of this License, to extend the patent 506 | license to downstream recipients. "Knowingly relying" means you have 507 | actual knowledge that, but for the patent license, your conveying the 508 | covered work in a country, or your recipient's use of the covered work 509 | in a country, would infringe one or more identifiable patents in that 510 | country that you have reason to believe are valid. 511 | 512 | If, pursuant to or in connection with a single transaction or 513 | arrangement, you convey, or propagate by procuring conveyance of, a 514 | covered work, and grant a patent license to some of the parties 515 | receiving the covered work authorizing them to use, propagate, modify 516 | or convey a specific copy of the covered work, then the patent license 517 | you grant is automatically extended to all recipients of the covered 518 | work and works based on it. 519 | 520 | A patent license is "discriminatory" if it does not include within 521 | the scope of its coverage, prohibits the exercise of, or is 522 | conditioned on the non-exercise of one or more of the rights that are 523 | specifically granted under this License. You may not convey a covered 524 | work if you are a party to an arrangement with a third party that is 525 | in the business of distributing software, under which you make payment 526 | to the third party based on the extent of your activity of conveying 527 | the work, and under which the third party grants, to any of the 528 | parties who would receive the covered work from you, a discriminatory 529 | patent license (a) in connection with copies of the covered work 530 | conveyed by you (or copies made from those copies), or (b) primarily 531 | for and in connection with specific products or compilations that 532 | contain the covered work, unless you entered into that arrangement, 533 | or that patent license was granted, prior to 28 March 2007. 534 | 535 | Nothing in this License shall be construed as excluding or limiting 536 | any implied license or other defenses to infringement that may 537 | otherwise be available to you under applicable patent law. 538 | 539 | 12. No Surrender of Others' Freedom. 540 | 541 | If conditions are imposed on you (whether by court order, agreement or 542 | otherwise) that contradict the conditions of this License, they do not 543 | excuse you from the conditions of this License. If you cannot convey a 544 | covered work so as to satisfy simultaneously your obligations under this 545 | License and any other pertinent obligations, then as a consequence you may 546 | not convey it at all. For example, if you agree to terms that obligate you 547 | to collect a royalty for further conveying from those to whom you convey 548 | the Program, the only way you could satisfy both those terms and this 549 | License would be to refrain entirely from conveying the Program. 550 | 551 | 13. Use with the GNU Affero General Public License. 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 Affero 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 special requirements of the GNU Affero General Public License, 559 | section 13, concerning interaction through a network will apply to the 560 | combination as such. 561 | 562 | 14. Revised Versions of this License. 563 | 564 | The Free Software Foundation may publish revised and/or new versions of 565 | the GNU General Public License from time to time. Such new versions will 566 | be similar in spirit to the present version, but may differ in detail to 567 | address new problems or concerns. 568 | 569 | Each version is given a distinguishing version number. If the 570 | Program specifies that a certain numbered version of the GNU General 571 | Public License "or any later version" applies to it, you have the 572 | option of following the terms and conditions either of that numbered 573 | version or of any later version published by the Free Software 574 | Foundation. If the Program does not specify a version number of the 575 | GNU General Public License, you may choose any version ever published 576 | by the Free Software Foundation. 577 | 578 | If the Program specifies that a proxy can decide which future 579 | versions of the GNU General Public License can be used, that proxy's 580 | public statement of acceptance of a version permanently authorizes you 581 | to choose that version for the Program. 582 | 583 | Later license versions may give you additional or different 584 | permissions. However, no additional obligations are imposed on any 585 | author or copyright holder as a result of your choosing to follow a 586 | later version. 587 | 588 | 15. Disclaimer of Warranty. 589 | 590 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 591 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 592 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 593 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 594 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 595 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 596 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 597 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 598 | 599 | 16. Limitation of Liability. 600 | 601 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 602 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 603 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 604 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 605 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 606 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 607 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 608 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 609 | SUCH DAMAGES. 610 | 611 | 17. Interpretation of Sections 15 and 16. 612 | 613 | If the disclaimer of warranty and limitation of liability provided 614 | above cannot be given local legal effect according to their terms, 615 | reviewing courts shall apply local law that most closely approximates 616 | an absolute waiver of all civil liability in connection with the 617 | Program, unless a warranty or assumption of liability accompanies a 618 | copy of the Program in return for a fee. 619 | 620 | END OF TERMS AND CONDITIONS 621 | 622 | How to Apply These Terms to Your New Programs 623 | 624 | If you develop a new program, and you want it to be of the greatest 625 | possible use to the public, the best way to achieve this is to make it 626 | free software which everyone can redistribute and change under these terms. 627 | 628 | To do so, attach the following notices to the program. It is safest 629 | to attach them to the start of each source file to most effectively 630 | state the exclusion of warranty; and each file should have at least 631 | the "copyright" line and a pointer to where the full notice is found. 632 | 633 | {one line to give the program's name and a brief idea of what it does.} 634 | Copyright (C) {year} {name of author} 635 | 636 | This program is free software: you can redistribute it and/or modify 637 | it under the terms of the GNU General Public License as published by 638 | the Free Software Foundation, either version 3 of the License, or 639 | (at your option) any later version. 640 | 641 | This program is distributed in the hope that it will be useful, 642 | but WITHOUT ANY WARRANTY; without even the implied warranty of 643 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 644 | GNU General Public License for more details. 645 | 646 | You should have received a copy of the GNU General Public License 647 | along with this program. If not, see . 648 | 649 | Also add information on how to contact you by electronic and paper mail. 650 | 651 | If the program does terminal interaction, make it output a short 652 | notice like this when it starts in an interactive mode: 653 | 654 | {project} Copyright (C) {year} {fullname} 655 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 656 | This is free software, and you are welcome to redistribute it 657 | under certain conditions; type `show c' for details. 658 | 659 | The hypothetical commands `show w' and `show c' should show the appropriate 660 | parts of the General Public License. Of course, your program's commands 661 | might be different; for a GUI interface, you would use an "about box". 662 | 663 | You should also get your employer (if you work as a programmer) or school, 664 | if any, to sign a "copyright disclaimer" for the program, if necessary. 665 | For more information on this, and how to apply and follow the GNU GPL, see 666 | . 667 | 668 | The GNU General Public License does not permit incorporating your program 669 | into proprietary programs. If your program is a subroutine library, you 670 | may consider it more useful to permit linking proprietary applications with 671 | the library. If this is what you want to do, use the GNU Lesser General 672 | Public License instead of this License. But first, please read 673 | . 674 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # axcc 2 | 3 | A small C11 compiler written in C++. 4 | 5 | This is just my personal work and it's not an optimizing compiler. Each stage of compilation in axcc is clearly divided and easy to read, including scanner, preprocessor (Dave Prosser's C macro expanding algorithm), evaluator, and parser (Basic recursive descent + ad-hoc tricks). Besides, axcc strictly follows the C11 standard, like clang with "-pedantic". 6 | 7 | So far I have completed the frontend and the internal ast can be printed. The backend is not finished so I haven't written a main function yet. If you need one you can write it yourself because it would be really simple (Just look at the test code in the tests directory). 8 | 9 | 10 | 11 | # TODO 12 | 13 | Code Generator. 14 | 15 | -------------------------------------------------------------------------------- /src/ast.cc: -------------------------------------------------------------------------------- 1 | #include "ast.hh" 2 | 3 | namespace axcc { 4 | 5 | void FuncDef::Print(std::ostream& os, std::size_t indent) const { 6 | os << std::string(indent, ' ') << "FuncDef " << identp_->Repr() << "\n"; 7 | bodyp_->Print(os, indent + 2); 8 | } 9 | 10 | void NullStmt::Print(std::ostream& os, std::size_t indent) const { 11 | os << std::string(indent, ' ') << "NullStmt\n"; 12 | } 13 | 14 | void ExprStmt::Print(std::ostream& os, std::size_t indent) const { 15 | os << std::string(indent, ' ') << "ExprStmt\n"; 16 | exprp_->Print(os, indent + 2); 17 | } 18 | 19 | void Initializer::Print(std::ostream& os, std::size_t indent) const { 20 | os << std::string(indent, ' ') << "Initializer "; 21 | os << "offset: " << off_ << '\n'; 22 | exprp_->Print(os, indent + 2); 23 | } 24 | 25 | void ObjDefStmt::Print(std::ostream& os, std::size_t indent) const { 26 | os << std::string(indent, ' ') << "ObjDefStmt " << objp_->Repr() << "\n"; 27 | for (const auto& init : inits_) 28 | init.Print(os, indent + 2); 29 | } 30 | 31 | void LabelStmt::Print(std::ostream& os, std::size_t indent) const { 32 | os << std::string(indent, ' ') << "LabelStmt " << labelp_->Repr() << "\n"; 33 | } 34 | 35 | IfStmt::IfStmt(const ExprPtr& condp, const StmtPtr& thenp, const StmtPtr& elsep) 36 | : Stmt{AstNodeKind::kIfStmt}, condp_{condp}, thenp_{thenp}, elsep_{elsep} { 37 | if (!IsScalarTy(condp->QType())) 38 | Error("statement requires expression of scalar type", condp->Loc()); 39 | } 40 | 41 | void IfStmt::Print(std::ostream& os, std::size_t indent) const { 42 | os << std::string(indent, ' ') << "IfStmt\n"; 43 | condp_->Print(os, indent + 2); 44 | thenp_->Print(os, indent + 2); 45 | if (elsep_.get() != nullptr) 46 | elsep_->Print(os, indent + 2); 47 | } 48 | 49 | void JumpStmt::Print(std::ostream& os, std::size_t indent) const { 50 | os << std::string(indent, ' ') << "JumpStmt " << dstp_->Repr() << "\n"; 51 | } 52 | 53 | void ReturnStmt::Print(std::ostream& os, std::size_t indent) const { 54 | os << std::string(indent, ' ') << "ReturnStmt\n"; 55 | if (ret_exprp_.get() != nullptr) 56 | ret_exprp_->Print(os, indent + 2); 57 | } 58 | 59 | void CmpdStmt::Print(std::ostream& os, std::size_t indent) const { 60 | os << std::string(indent, ' ') << "CmpdStmt\n"; 61 | for (const auto& stmtp : stmts_) 62 | stmtp->Print(os, indent + 2); 63 | } 64 | 65 | UnaryExpr::UnaryExpr(const SourceLocPtr& locp, const UnaryOpKind& op_kind, 66 | const ExprPtr& operandp) 67 | : Expr{AstNodeKind::kUnaryExpr, locp}, 68 | op_kind_{op_kind}, operandp_{operandp} { 69 | assert(op_kind != UnaryOpKind::kCast); 70 | if (!operandp_ || operandp_->HasErr()) { 71 | // Suppress subsequent errors. 72 | SetErrFlags(); 73 | return; 74 | } 75 | // Do type checking and set the expression's type and lvalue property. 76 | switch (op_kind_) { 77 | case UnaryOpKind::kPreInc: 78 | case UnaryOpKind::kPreDec: 79 | case UnaryOpKind::kPostInc: 80 | case UnaryOpKind::kPostDec: 81 | SetTypeIncDec(); 82 | break; 83 | case UnaryOpKind::kPlus: 84 | case UnaryOpKind::kMinus: 85 | SetTypePlusMinus(); 86 | break; 87 | case UnaryOpKind::kBitNot: 88 | SetTypeBitNot(); 89 | break; 90 | case UnaryOpKind::kLogicNot: 91 | SetTypeLogicNot(); 92 | break; 93 | case UnaryOpKind::kDeref: 94 | SetTypeDeref(); 95 | break; 96 | case UnaryOpKind::kAddrOf: 97 | SetTypeAddrOf(); 98 | break; 99 | default: 100 | assert(false); 101 | } 102 | } 103 | 104 | UnaryExpr::UnaryExpr(const SourceLocPtr& locp, const QualType& dst_qtype, 105 | const ExprPtr& operandp) 106 | : Expr{AstNodeKind::kUnaryExpr, locp, dst_qtype}, 107 | op_kind_{UnaryOpKind::kCast}, operandp_{operandp} { 108 | if (!operandp_ || operandp_->HasErr()) { 109 | SetErrFlags(); 110 | return; 111 | } 112 | SetTypeCast(); 113 | } 114 | 115 | // C11 6.5.2.4p1 & 6.5.3.1p1: The operand of the postfix/prefix increment or 116 | // decrement operator shall have atomic, qualified, or unqualified real or 117 | // pointer type, and shall be a modifiable lvalue. 118 | void UnaryExpr::SetTypeIncDec() { 119 | // We don't need to perform the value transformation on the array type or 120 | // the function type first because whether it is transformed or not, they 121 | // can not pass the check of IsModifiableLVal(). 122 | if (!IsModifiableLVal(*operandp_)) { 123 | ErrInExpr("operand should be a modifiable lvalue"); 124 | } else if (!IsScalarTy(operandp_->QType())) { 125 | ErrInExpr("operand of real or pointer type expected"); 126 | } else { 127 | SetQType(LoseAllQuals(operandp_->QType())); 128 | } 129 | } 130 | 131 | // C11 6.5.3.3p1: The operand of the unary + or - operator shall have 132 | // arithmetic type; of the ~ operator, integer type; of the ! operator, 133 | // scalar type. 134 | void UnaryExpr::SetTypePlusMinus() { 135 | if (!IsArithTy(operandp_->QType())) { 136 | ErrInExpr("operand of arithmetic type expected"); 137 | } else { 138 | // First apply integral promotions. 139 | SetQType(TryIntPromote(operandp_)); 140 | } 141 | } 142 | 143 | void UnaryExpr::SetTypeBitNot() { 144 | if (!IsIntegerTy(operandp_->QType())) { 145 | ErrInExpr("operand of integer type expected"); 146 | } else { 147 | SetQType(TryIntPromote(operandp_)); 148 | } 149 | } 150 | 151 | void UnaryExpr::SetTypeLogicNot() { 152 | QualType operand_qty = ValueTrans(operandp_->QType()); 153 | if (!IsScalarTy(operand_qty)) 154 | // Do not set the error flags here so that we can check for more errors. 155 | Error("operand of scalar type expected", Loc()); 156 | SetQType(MakeQType(ArithType::kASInt)); 157 | } 158 | 159 | // C11 6.5.3.2p2: The operand of the unary * operator shall have pointer type. 160 | void UnaryExpr::SetTypeDeref() { 161 | QualType operand_qty = ValueTrans(operandp_->QType()); 162 | if (!IsPointerTy(operand_qty)) { 163 | ErrInExpr("operand of pointer type expected"); 164 | } else { 165 | SetQType(TypeConv(operand_qty).PointeeQTy()); 166 | if (!IsFuncTy(QType())) 167 | SetLVal(); 168 | } 169 | } 170 | 171 | // C11 6.5.3.2p1: The operand of the unary & operator shall be either a function 172 | // designator, the result of a [] or unary * operator, or an lvalue that 173 | // designates an object that is not a bit-field and is not declared with the 174 | // register storage-class specifier. 175 | void UnaryExpr::SetTypeAddrOf() { 176 | // The cases where the operand is the result of a [] or unary * operator are 177 | // left to the parser to handle. 178 | if (!IsFuncTy(operandp_->QType()) && !operandp_->IsLVal()) { 179 | ErrInExpr("operand should be an lvalue or have a function type"); 180 | } else if (IsObject(*operandp_) && 181 | NodeConv(*operandp_).Storage() == StorKind::kRegister) { 182 | ErrInExpr("address of register variable requested"); 183 | } else { 184 | if (IsBinaryExpr(*operandp_)) { 185 | auto& bin_expr = NodeConv(*operandp_); 186 | if (bin_expr.OpKind() == BinaryOpKind::kMemAccs && 187 | IsBitField(*bin_expr.Rhsp())) { 188 | ErrInExpr("address of bit-field requested"); 189 | return; 190 | } 191 | } 192 | SetQType(MakeQType(operandp_->QType())); 193 | } 194 | } 195 | 196 | // C11 6.5.4 Cast operators 197 | void UnaryExpr::SetTypeCast() { 198 | QualType operand_qty = ValueTrans(operandp_->QType()); 199 | if (IsVoidTy(QType())) { 200 | // If the target type is void, then expression is evaluated for its 201 | // side-effects and its returned value is discarded. 202 | } else if (!IsScalarTy(QType())) { 203 | ErrInExpr("scalar type expected"); 204 | } else if (!IsScalarTy(operand_qty)) { 205 | ErrInExpr("operand of scalar type expected", operandp_->Loc()); 206 | } else if (IsPointerTy(QType()) && IsFloatingTy(operand_qty)) { 207 | ErrInExpr("float type can not be convert to pointer type"); 208 | } else if (IsPointerTy(operand_qty) && IsFloatingTy(QType())) { 209 | ErrInExpr("pointer type can not be convert to float type"); 210 | } else { 211 | if ((IsObjPtrTy(QType()) && IsFuncPtrTy(operand_qty)) || 212 | (IsObjPtrTy(operand_qty) && IsFuncPtrTy(QType()))) { 213 | // In all C standards the conversion between pointer-to-function and 214 | // pointer-to-object is not defined. 215 | Warning("incompatible pointer types conversion", Loc()); 216 | } 217 | // Reset the type. The value category of the cast expression is always 218 | // non-lvalue. Use LoseAllQuals() here, not ValueTrans(). 219 | SetQType(LoseAllQuals(QType())); 220 | } 221 | } 222 | 223 | void UnaryExpr::Print(std::ostream& os, std::size_t indent) const { 224 | os << std::string(indent, ' ') << "UnaryExpr '" << QType().Repr() << "' "; 225 | switch (op_kind_) { 226 | case UnaryOpKind::kPreInc: os << "prefix '++'"; break; 227 | case UnaryOpKind::kPreDec: os << "prefix '--'"; break; 228 | case UnaryOpKind::kPostInc: os << "postfix '++'"; break; 229 | case UnaryOpKind::kPostDec: os << "postfix '--'"; break; 230 | case UnaryOpKind::kPlus: os << "'+'"; break; 231 | case UnaryOpKind::kMinus: os << "'-'"; break; 232 | case UnaryOpKind::kBitNot: os << "'~'"; break; 233 | case UnaryOpKind::kLogicNot: os << "'!'"; break; 234 | case UnaryOpKind::kDeref: os << "'*'"; break; 235 | case UnaryOpKind::kAddrOf: os << "'&'"; break; 236 | case UnaryOpKind::kCast: os << "cast"; break; 237 | default: assert(false); 238 | } 239 | os << "\n"; 240 | operandp_->Print(os, indent + 2); 241 | } 242 | 243 | BinaryExpr::BinaryExpr(const SourceLocPtr& locp, const BinaryOpKind& op_kind, 244 | const ExprPtr& lhsp, const ExprPtr& rhsp) 245 | : Expr{AstNodeKind::kBinaryExpr, locp}, 246 | op_kind_{op_kind}, lhsp_{lhsp}, rhsp_{rhsp} { 247 | if (!lhsp_ || !rhsp_ || lhsp_->HasErr() || rhsp_->HasErr()) { 248 | SetErrFlags(); 249 | return; 250 | } 251 | switch (op_kind_) { 252 | case BinaryOpKind::kAsgn: 253 | SetTypeAsgn(); 254 | break; 255 | case BinaryOpKind::kAdd: 256 | case BinaryOpKind::kSub: 257 | SetTypeAddOps(); 258 | break; 259 | case BinaryOpKind::kPro: 260 | case BinaryOpKind::kDiv: 261 | case BinaryOpKind::kMod: 262 | SetTypeMulOps(); 263 | break; 264 | case BinaryOpKind::kBitAnd: 265 | case BinaryOpKind::kBitOr: 266 | case BinaryOpKind::kBitXor: 267 | SetTypeBitLogicOps(); 268 | break; 269 | case BinaryOpKind::kBitShl: 270 | case BinaryOpKind::kBitShr: 271 | SetTypeShiftOps(); 272 | break; 273 | case BinaryOpKind::kLogicAnd: 274 | case BinaryOpKind::kLogicOr: 275 | SetTypeLogicOps(); 276 | break; 277 | case BinaryOpKind::kEqual: 278 | case BinaryOpKind::kNEqual: 279 | SetTypeEqualOps(); 280 | break; 281 | case BinaryOpKind::kLess: 282 | case BinaryOpKind::kGreater: 283 | case BinaryOpKind::kLessEq: 284 | case BinaryOpKind::kGreaterEq: 285 | SetTypeRelationOps(); 286 | break; 287 | case BinaryOpKind::kMemAccs: 288 | SetTypeMemAccs(); 289 | break; 290 | case BinaryOpKind::kComma: 291 | SetTypeComma(); 292 | break; 293 | default: 294 | assert(false); 295 | } 296 | } 297 | 298 | // C11 6.5.16.1 Simple assignment 299 | void BinaryExpr::SetTypeAsgn() { 300 | if (!IsModifiableLVal(*lhsp_)) { 301 | ErrInExpr("left operand should be a modifiable lvalue"); 302 | } else { 303 | SetQType(ConvAsIfByAsgn(rhsp_, lhsp_->QType())); 304 | // We don't have to set the error flags here if errors occur during 305 | // the type conversion. 306 | } 307 | } 308 | 309 | // C11 6.5.6 Additive operators 310 | void BinaryExpr::SetTypeAddOps() { 311 | QualType lhs_qtype = ValueTrans(lhsp_->QType()); 312 | QualType rhs_qtype = ValueTrans(rhsp_->QType()); 313 | if (IsArithTy(lhs_qtype) && IsArithTy(rhs_qtype)) { 314 | SetQType(UsualArithConv(lhsp_, rhsp_)); 315 | } else if (IsPointerTy(lhs_qtype) || IsPointerTy(rhs_qtype)) { 316 | auto is_complete_obj_ptr_ty = [this] (QualType ptr_qtype) { 317 | if (!IsVoidPtrTy(ptr_qtype) && !IsFuncPtrTy(ptr_qtype) && 318 | !TypeConv(ptr_qtype).PointeeQTy()->IsComplete()) { 319 | ErrInExpr("arithmetic on incomplete object type"); 320 | return false; 321 | } else { 322 | if (IsVoidPtrTy(ptr_qtype)) { 323 | Warning("arithmetic on pointer to void type"); 324 | } else if (IsFuncPtrTy(ptr_qtype)) { 325 | Warning("arithmetic on pointer to function type"); 326 | } 327 | return true; 328 | } 329 | }; 330 | if (IsPointerTy(lhs_qtype) && IsPointerTy(rhs_qtype) && 331 | op_kind_ == BinaryOpKind::kSub) { 332 | QualType lhs_pte_qty = TypeConv(lhs_qtype).PointeeQTy(); 333 | QualType rhs_pte_qty = TypeConv(rhs_qtype).PointeeQTy(); 334 | if (!lhs_pte_qty->IsCompatible(rhs_pte_qty)) { 335 | ErrInExpr("arithmetic on pointers to incompatible types"); 336 | } else if (is_complete_obj_ptr_ty(lhs_qtype)) { 337 | // C11 6.5.6p9: The size of the result is implementation-defined, 338 | // and its type (a signed integer type) is ptrdiff_t defined in 339 | // the header. 340 | SetQType(MakeQType(ArithType::kASLong)); 341 | } 342 | } else if (!IsIntegerTy(lhs_qtype) && !IsIntegerTy(rhs_qtype)) { 343 | ErrInExpr("invalid operands to additive operators"); 344 | } else { 345 | QualType ptr_qtype = IsIntegerTy(lhs_qtype) ? rhs_qtype : lhs_qtype; 346 | if (is_complete_obj_ptr_ty(ptr_qtype)) 347 | SetQType(ptr_qtype); 348 | } 349 | } else { 350 | ErrInExpr("invalid operands to additive operators"); 351 | } 352 | } 353 | 354 | // C11 6.5.5p2: Each of the operands shall have arithmetic type. The operands of 355 | // the % operator shall have integer type. 356 | void BinaryExpr::SetTypeMulOps() { 357 | if (op_kind_ == BinaryOpKind::kMod && 358 | (!IsIntegerTy(lhsp_->QType()) || !IsIntegerTy(rhsp_->QType()))) { 359 | ErrInExpr("operands of integer type expected"); 360 | } else if (!IsArithTy(lhsp_->QType()) || !IsArithTy(rhsp_->QType())) { 361 | ErrInExpr("operands of arithmetic type expected"); 362 | } else { 363 | SetQType(UsualArithConv(lhsp_, rhsp_)); 364 | } 365 | } 366 | 367 | // C11 6.5.10p2 & 6.5.11p2 & 6.5.12p2 : Each of the operands shall have integer 368 | // type. 369 | void BinaryExpr::SetTypeBitLogicOps() { 370 | if (!IsIntegerTy(lhsp_->QType()) || !IsIntegerTy(rhsp_->QType())) { 371 | ErrInExpr("operands of integer type expected"); 372 | } else { 373 | SetQType(UsualArithConv(lhsp_, rhsp_)); 374 | } 375 | } 376 | 377 | // C11 6.5.7p2: Each of the operands shall have integer type. 378 | void BinaryExpr::SetTypeShiftOps() { 379 | if (!IsIntegerTy(lhsp_->QType()) || !IsIntegerTy(rhsp_->QType())) { 380 | ErrInExpr("operands of integer type expected"); 381 | } else { 382 | IntPromote(rhsp_); 383 | SetQType(IntPromote(lhsp_)); 384 | } 385 | } 386 | 387 | // C11 6.5.13p2 & 6.5.14p2: Each of the operands shall have scalar type. 388 | void BinaryExpr::SetTypeLogicOps() { 389 | QualType lhs_qtype = ValueTrans(lhsp_->QType()); 390 | QualType rhs_qtype = ValueTrans(rhsp_->QType()); 391 | if (!IsScalarTy(lhs_qtype) || !IsScalarTy(rhs_qtype)) 392 | Error("operands of scalar type expected", Loc()); 393 | SetQType(MakeQType(ArithType::kASInt)); 394 | } 395 | 396 | // C11 6.5.9 Equality operators 397 | void BinaryExpr::SetTypeEqualOps() { 398 | QualType lhs_qtype = ValueTrans(lhsp_->QType()); 399 | QualType rhs_qtype = ValueTrans(rhsp_->QType()); 400 | if (IsArithTy(lhs_qtype) && IsArithTy(rhs_qtype)) { 401 | UsualArithConv(lhsp_, rhsp_); 402 | } else if (IsPointerTy(lhs_qtype) && IsPointerTy(rhs_qtype)) { 403 | QualType lhs_pte_qty = TypeConv(lhs_qtype).PointeeQTy(); 404 | QualType rhs_pte_qty = TypeConv(rhs_qtype).PointeeQTy(); 405 | if (!lhs_pte_qty->IsCompatible(rhs_pte_qty)) { 406 | if (!IsVoidTy(lhs_pte_qty) && !IsVoidTy(rhs_pte_qty)) { 407 | Warning("equality comparison between pointers to incompatible " 408 | "types", Loc()); 409 | } else if (IsFuncTy(lhs_pte_qty) || IsFuncTy(rhs_pte_qty)) { 410 | Warning("equality comparison between function pointer and " 411 | "void pointer", Loc()); 412 | } 413 | } 414 | } else { 415 | Error("invalid operands to equality operators", Loc()); 416 | } 417 | SetQType(MakeQType(ArithType::kASInt)); 418 | } 419 | 420 | // C11 6.5.8 Relational operators 421 | void BinaryExpr::SetTypeRelationOps() { 422 | QualType lhs_qtype = ValueTrans(lhsp_->QType()); 423 | QualType rhs_qtype = ValueTrans(rhsp_->QType()); 424 | if (IsArithTy(lhs_qtype) && IsArithTy(rhs_qtype)) { 425 | UsualArithConv(lhsp_, rhsp_); 426 | } else if (IsPointerTy(lhs_qtype) && IsPointerTy(rhs_qtype)) { 427 | if (!TypeConv(lhs_qtype).PointeeQTy()->IsCompatible( 428 | TypeConv(rhs_qtype).PointeeQTy())) { 429 | Warning("comparsion between pointers to incompatible types", Loc()); 430 | } else if (IsFuncPtrTy(lhs_qtype) || IsFuncPtrTy(rhs_qtype)) { 431 | Warning("comparsion with function pointer", Loc()); 432 | } 433 | } else { 434 | Error("invalid operands to relational operators", Loc()); 435 | } 436 | SetQType(MakeQType(ArithType::kASInt)); 437 | } 438 | 439 | // C11 6.5.2.3p1: The first operand of the . operator shall have an atomic, 440 | // qualified, or unqualified structure or union type, and the second operand 441 | // shall name a member of that type. 442 | void BinaryExpr::SetTypeMemAccs() { 443 | assert(IsObject(*rhsp_)); 444 | if (!IsRecordTy(lhsp_->QType())) { 445 | ErrInExpr("left operand should be a structure or union"); 446 | } else if (!lhsp_->QType()->IsComplete()) { 447 | ErrInExpr("incomplete definition of type"); 448 | } else { 449 | std::string name = NodeConv(*rhsp_).Name(); 450 | ObjectPtr memberp = TypeConv(lhsp_->QType()).GetMember(name); 451 | if (memberp.get() == nullptr) { 452 | ErrInExpr("no member named '" + name + "' in the struct/union type" 453 | "of left operand"); 454 | } else { 455 | // Replace the temporarily constructed object with the one stored 456 | // in the struct/union. 457 | rhsp_ = memberp; 458 | if (rhsp_->HasErr()) { 459 | SetErrFlags(); 460 | return; 461 | } 462 | QualType member_qtype = memberp->QType(); 463 | member_qtype.MergeQuals(lhsp_->QType()); 464 | SetQType(member_qtype); 465 | if (lhsp_->IsLVal()) 466 | SetLVal(); 467 | } 468 | } 469 | } 470 | 471 | // C11 6.5.17 Comma operator 472 | void BinaryExpr::SetTypeComma() { 473 | SetQType(ValueTrans(rhsp_->QType())); 474 | } 475 | 476 | void BinaryExpr::Print(std::ostream& os, std::size_t indent) const { 477 | os << std::string(indent, ' ') << "BinaryExpr '" << QType().Repr() << "' "; 478 | switch (op_kind_) { 479 | case BinaryOpKind::kAsgn: os << "'='"; break; 480 | case BinaryOpKind::kAdd: os << "'+'"; break; 481 | case BinaryOpKind::kSub: os << "'-'"; break; 482 | case BinaryOpKind::kPro: os << "'*'"; break; 483 | case BinaryOpKind::kDiv: os << "'/'"; break; 484 | case BinaryOpKind::kMod: os << "'%'"; break; 485 | case BinaryOpKind::kBitAnd: os << "'&'"; break; 486 | case BinaryOpKind::kBitOr: os << "'|'"; break; 487 | case BinaryOpKind::kBitXor: os << "'^'"; break; 488 | case BinaryOpKind::kBitShl: os << "'<<'"; break; 489 | case BinaryOpKind::kBitShr: os << "'>>'"; break; 490 | case BinaryOpKind::kLogicAnd: os << "'&&'"; break; 491 | case BinaryOpKind::kLogicOr: os << "'||'"; break; 492 | case BinaryOpKind::kEqual: os << "'=='"; break; 493 | case BinaryOpKind::kNEqual: os << "'!='"; break; 494 | case BinaryOpKind::kLess: os << "'<'"; break; 495 | case BinaryOpKind::kGreater: os << "'>'"; break; 496 | case BinaryOpKind::kLessEq: os << "'<='"; break; 497 | case BinaryOpKind::kGreaterEq: os << "'>='"; break; 498 | case BinaryOpKind::kMemAccs: os << "'.'"; break; 499 | case BinaryOpKind::kComma: os << "','"; break; 500 | default: assert(false); 501 | } 502 | os << "\n"; 503 | lhsp_->Print(os, indent + 2); 504 | rhsp_->Print(os, indent + 2); 505 | } 506 | 507 | // C11 6.5.15 Conditional operator 508 | TernaryExpr::TernaryExpr(const SourceLocPtr& locp, const ExprPtr& condp, 509 | const ExprPtr& truep, const ExprPtr& falsep) 510 | : Expr{AstNodeKind::kTernaryExpr, locp}, 511 | condp_{condp}, truep_{truep}, falsep_{falsep} { 512 | if (!condp_ || !truep_ || !falsep_ || 513 | condp_->HasErr() || truep_->HasErr() || falsep_->HasErr()) { 514 | SetErrFlags(); 515 | return; 516 | } 517 | QualType lhs_qtype = ValueTrans(truep_->QType()); 518 | QualType rhs_qtype = ValueTrans(falsep_->QType()); 519 | if (!IsScalarTy(ValueTrans(condp_->QType()))) { 520 | ErrInExpr("the condition expression should have scalar type"); 521 | } else if (IsArithTy(lhs_qtype) && IsArithTy(rhs_qtype)) { 522 | SetQType(UsualArithConv(truep_, falsep_)); 523 | } else if (IsPointerTy(lhs_qtype) && IsPointerTy(rhs_qtype)) { 524 | QualType lhs_pte_qty = TypeConv(lhs_qtype).PointeeQTy(); 525 | QualType rhs_pte_qty = TypeConv(rhs_qtype).PointeeQTy(); 526 | QualType final_pte_qty = lhs_pte_qty; 527 | if (!lhs_pte_qty->IsCompatible(rhs_pte_qty)) { 528 | if (IsVoidTy(lhs_pte_qty) || IsVoidTy(rhs_pte_qty)) { 529 | if (IsFuncTy(lhs_pte_qty) || IsFuncTy(rhs_pte_qty)) 530 | Warning("conditional operator with function pointer and " 531 | "void pointer", Loc()); 532 | } else { 533 | Warning("pointer type mismatch", Loc()); 534 | } 535 | final_pte_qty = MakeQType(); 536 | final_pte_qty.MergeQuals(lhs_pte_qty); 537 | } 538 | final_pte_qty.MergeQuals(rhs_pte_qty); 539 | SetQType(MakeQType(final_pte_qty)); 540 | } else if (lhs_qtype->IsCompatible(rhs_qtype)) { 541 | // Now the type must be void type or struct/union type. 542 | assert(IsVoidTy(lhs_qtype) || IsRecordTy(lhs_qtype)); 543 | SetQType(lhs_qtype); 544 | } else { 545 | ErrInExpr("incompatible operand types"); 546 | } 547 | } 548 | 549 | void TernaryExpr::Print(std::ostream& os, std::size_t indent) const { 550 | os << std::string(indent, ' ') << "ConditionalExpr '"; 551 | os << QType().Repr() << "'\n"; 552 | condp_->Print(os, indent + 2); 553 | truep_->Print(os, indent + 2); 554 | falsep_->Print(os, indent + 2); 555 | } 556 | 557 | // C11 6.5.2.2 Function calls 558 | FuncCall::FuncCall(const SourceLocPtr& locp, const ExprPtr& funcp, 559 | const std::vector& args) 560 | : Expr{AstNodeKind::kFuncCall, locp}, 561 | funcp_{funcp}, args_{args} { 562 | // Only checks if there are some errors in the function pointer expression 563 | // and put off the check of arguments. 564 | if (!funcp_ || funcp_->HasErr()) { 565 | SetErrFlags(); 566 | return; 567 | } 568 | QualType funcp_qty = ValueTrans(funcp_->QType()); 569 | if (!IsFuncPtrTy(funcp_qty)) { 570 | ErrInExpr("called object is not a function or function pointer"); 571 | } else { 572 | QualType func_qty = TypeConv(funcp_qty).PointeeQTy(); 573 | const auto& func_type = TypeConv(func_qty); 574 | QualType ret_qtype = func_type.RetQType(); 575 | const auto& params = func_type.Params(); 576 | // The function type we got here will never return an array type or a 577 | // function type. This kind of error will be diagnosed by the parser. 578 | assert(!IsArrayTy(ret_qtype) && !IsFuncTy(ret_qtype)); 579 | if (!IsVoidTy(ret_qtype) && !ret_qtype->IsComplete()) { 580 | ErrInExpr("calling function with incomplete return type"); 581 | } else { 582 | if (params.size() > args_.size()) { 583 | Error("too few arguments to function call", Loc()); 584 | } else if (params.size() < args_.size()) { 585 | Error("too many arguments to function call", Loc()); 586 | } else { 587 | for (int i = 0; i < args_.size(); ++i) { 588 | if (args_[i]->HasErr()) { 589 | // Do nothing here. 590 | } else if (!args_[i]->QType()->IsComplete()) { 591 | Error("argument type is incomplete", Loc()); 592 | } else { 593 | ConvAsIfByAsgn(args_[i], params[i]->QType()); 594 | } 595 | } 596 | } 597 | SetQType(LoseAllQuals(ret_qtype)); 598 | } 599 | } 600 | } 601 | 602 | void FuncCall::Print(std::ostream& os, std::size_t indent) const { 603 | os << std::string(indent, ' ') << "FuncCall '" << QType().Repr() << "'\n"; 604 | funcp_->Print(os, indent + 2); 605 | for (const auto& argp : args_) 606 | argp->Print(os, indent + 2); 607 | } 608 | 609 | void Constant::Print(std::ostream& os, std::size_t indent) const { 610 | os << std::string(indent, ' ') << "Constant '" << QType().Repr() << "' "; 611 | if (IsSignedTy(QType())) 612 | os << ll_val_ << "\n"; 613 | else 614 | os << ull_val_ << "\n"; 615 | } 616 | 617 | StrLiteral::StrLiteral(const SourceLocPtr& locp, const std::string& str, 618 | const EncKind& enc) 619 | : Expr{AstNodeKind::kStrLiteral, locp}, str_{str}, enc_{enc} { 620 | unsigned int arith_kind = 0; 621 | std::size_t str_size = 0; 622 | switch (enc_) { 623 | case EncKind::kUtf8: 624 | arith_kind |= ArithType::kASChar; 625 | str_size = Str().size(); 626 | break; 627 | case EncKind::kUtf16: 628 | arith_kind |= ArithType::kASShort; 629 | str_size = U16Str().size(); 630 | break; 631 | case EncKind::kUtf32: 632 | arith_kind |= ArithType::kASInt; 633 | str_size = U32Str().size(); 634 | break; 635 | default: assert(false); 636 | } 637 | SetQType(MakeQType(MakeQType(arith_kind), str_size)); 638 | } 639 | 640 | void StrLiteral::Print(std::ostream& os, std::size_t indent) const { 641 | os << std::string(indent, ' ') << "StrLiteral '" << QType().Repr() << "' "; 642 | os << std::hex; 643 | for (const auto c : str_) 644 | os << "\\x" << static_cast(c); 645 | os << std::dec << "\n"; 646 | } 647 | 648 | // C11 6.4.5p5: If any of the tokens has an encoding prefix, the resulting 649 | // multibyte character sequence is treated as having the same prefix; 650 | void StrLiteral::Concat(const StrLiteral& other) { 651 | str_ += other.str_; 652 | if (enc_ == EncKind::kUtf8 && 653 | (other.enc_ == EncKind::kUtf16 || other.enc_ == EncKind::kUtf32)) 654 | enc_ = other.enc_; 655 | } 656 | 657 | AddrConstant::AddrConstant(const StrLiteralPtr& literalp) 658 | : AddrConstant(literalp->Labelp()->Name()) { 659 | literalp_ = literalp; 660 | } 661 | 662 | void AddrConstant::Print(std::ostream& os, std::size_t indent) const { 663 | os << std::string(indent, ' ') << "AddrConstant "; 664 | os << "offset: " << off_; 665 | if (literalp_.get() != nullptr) { 666 | os << "\n"; 667 | literalp_->Print(os, indent + 2); 668 | } else { 669 | os << " label name: " << label_name_ << '\n'; 670 | } 671 | } 672 | 673 | void Ident::Print(std::ostream& os, std::size_t indent) const { 674 | os << std::string(indent, ' ') << "Identifier " << Repr() << "\n"; 675 | } 676 | 677 | std::string Ident::Repr() const { 678 | std::string repr{}; 679 | if (QType().HasRawType()) { 680 | repr += "'"; 681 | repr += QType().Repr(); 682 | repr += "' "; 683 | } 684 | repr += name_; 685 | return repr; 686 | } 687 | 688 | void TempObj::Print(std::ostream& os, std::size_t indent) const { 689 | os << std::string(indent, ' ') << "TempObj " << Repr() << '\n'; 690 | for (const auto& init : inits_) 691 | init.Print(os, indent + 2); 692 | } 693 | 694 | void AstRoot::Print(std::ostream& os) const { 695 | for (const auto& ext_declp : ext_decls_) 696 | ext_declp->Print(os, 0); 697 | } 698 | 699 | // C11 6.3.2.1p1: A modifiable lvalue is an lvalue that does not have array 700 | // type, does not have an incomplete type, does not have a const-qualified 701 | // type, and if it is a structure or union, does not have any member 702 | // (including, recursively, any member or element of all contained aggregates 703 | // or unions) with a const-qualified type. 704 | bool IsModifiableLVal(const Expr& expr) { 705 | if (!expr.IsLVal()) 706 | return false; 707 | QualType qtype = expr.QType(); 708 | if (!qtype->IsComplete() || qtype.IsConst() || IsArrayTy(qtype)) 709 | return false; 710 | if (IsRecordTy(qtype)) 711 | return !TypeConv(qtype).HasConstMember(); 712 | return true; 713 | } 714 | 715 | } 716 | -------------------------------------------------------------------------------- /src/ast.hh: -------------------------------------------------------------------------------- 1 | #ifndef _AXCC_AST_HH_ 2 | #define _AXCC_AST_HH_ 3 | 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | 11 | #include "token.hh" 12 | #include "type.hh" 13 | #include "encoding.hh" 14 | #include "error.hh" 15 | 16 | namespace axcc { 17 | 18 | // Forward Declartion 19 | class AstNode; 20 | class FuncDef; 21 | class Stmt; 22 | class NullStmt; 23 | class ExprStmt; 24 | class ObjDefStmt; 25 | class LabelStmt; 26 | class IfStmt; 27 | class JumpStmt; 28 | class ReturnStmt; 29 | class CmpdStmt; 30 | class Expr; 31 | class UnaryExpr; 32 | class BinaryExpr; 33 | class TernaryExpr; 34 | class FuncCall; 35 | class Constant; 36 | class StrLiteral; 37 | class AddrConstant; 38 | class Ident; 39 | class Tag; 40 | class Label; 41 | class FuncName; 42 | class TypedefName; 43 | class Enumerator; 44 | class Object; 45 | class BitField; 46 | class TempObj; 47 | 48 | // Type alias 49 | using AstNodePtr = std::shared_ptr; 50 | using FuncDefPtr = std::shared_ptr; 51 | using StmtPtr = std::shared_ptr; 52 | using NullStmtPtr = std::shared_ptr; 53 | using ExprStmtPtr = std::shared_ptr; 54 | using ObjDefStmtPtr = std::shared_ptr; 55 | using LabelStmtPtr = std::shared_ptr; 56 | using IfStmtPtr = std::shared_ptr; 57 | using JumpStmtPtr = std::shared_ptr; 58 | using ReturnStmtPtr = std::shared_ptr; 59 | using CmpdStmtPtr = std::shared_ptr; 60 | using ExprPtr = std::shared_ptr; 61 | using UnaryExprPtr = std::shared_ptr; 62 | using BinaryExprPtr = std::shared_ptr; 63 | using TernaryExprPtr = std::shared_ptr; 64 | using FuncCallPtr = std::shared_ptr; 65 | using ConstantPtr = std::shared_ptr; 66 | using StrLiteralPtr = std::shared_ptr; 67 | using AddrConstantPtr = std::shared_ptr; 68 | using IdentPtr = std::shared_ptr; 69 | using TagPtr = std::shared_ptr; 70 | using LabelPtr = std::shared_ptr