├── .gitignore ├── LICENSE ├── README.md ├── add_digit └── add_digit.asm ├── conta_cifre └── conta_cifre.asm ├── conta_min_ug_mag └── conta_min_ug_mag.asm ├── conta_volte └── conta_volte.asm ├── count-char └── count-char.asm ├── div └── div.asm ├── esercizio_1 └── esercizio_1.asm ├── esercizio_2 └── esercizio_2.asm ├── io └── IO.asm ├── maiusc └── maiusc.asm ├── minusc └── minusc.asm ├── somma_se └── somma_se.asm ├── sommatoria_array ├── sommatoria_array.asm └── sommatoria_array_2.asm ├── sum_two └── sum_two.asm └── tipo_car └── tipo_car.asm /.gitignore: -------------------------------------------------------------------------------- 1 | # Misc 2 | 3 | .DS_Store 4 | 5 | # LC-2 Compiled files 6 | 7 | *.bin 8 | *.hex 9 | *.lst 10 | *.obj 11 | *.sym 12 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # LC-2 Execises 2 | > 💻 From Bits and Gates to C and Beyond... 3 | 4 | A series of execises for the Computing Systems course of ["Sicurezza dei Sistemi e delle Reti Informatiche"](http://www.cosp.unimi.it/offerta_didattica/F68.htm) at Università degli Studi di Milano. 5 | 6 | Each .asm program can be compiled with "Litte Computer 2" (LC-2) simulator, an educative simple computer used to 7 | introduce general-purpose computing devices to first-year engineering students with no previous background in computer architecture or 8 | logic design. 9 | 10 | A complete documentation reference of LC-2 architecture and its ISA can be found here: 11 | 12 | [https://www.cs.utexas.edu/users/fussell/courses/cs310h/simulator/lc2.pdf](https://www.cs.utexas.edu/users/fussell/courses/cs310h/simulator/lc2.pdf) -------------------------------------------------------------------------------- /add_digit/add_digit.asm: -------------------------------------------------------------------------------- 1 | ;****************************************************************** 2 | ; 3 | ;SOTTOPROGRAMMA DI AGGIUNTA DI UNA CIFRA ASCII A UN NUMERO DECIMALE 4 | ; 5 | ; INPUT R0 = Numero N 6 | ; INPUT R1 = cifra C (compresa fra x30 ex39) 7 | ; 8 | ; OUTPUT R0 = N * 10 + val(C) 9 | ; 10 | ;****************************************************************** 11 | 12 | .orig x3000 13 | LD R0, N ; Carico il numero N 14 | LD R1, C ; Carico la cifra C 15 | JSR add_digit 16 | TRAP x25 17 | 18 | add_digit 19 | ; Salvo il valore dei registri 20 | ST R2, saveR2 21 | ST R3, saveR3 22 | ST R4, saveR4 23 | 24 | AND R2, R2, #0 ; R2 = 0 25 | ADD R2, R2, #10 ; R2 = 10, contatore per effettuare la moltiplicazione 26 | 27 | ; Moltiplico N * 10 28 | multiply 29 | ADD R3, R3, R0 ; R3 = R3 + N, 30 | ADD R2, R2, #-1 ; Decremento il contatore 31 | BRP multiply ; Continua a moltiplicare 32 | BRNZ sumc 33 | 34 | ; Sommo ad N * 10 il valore di C 35 | sumc LD R4, char30 36 | NOT R4, R4 37 | ADD R4, R4 #1 ; R4 = -30 38 | ADD R4, R4, R1 ; R4 = val(C) 39 | ADD R4, R4, R3 ; R4 = N * 10 + val(C) 40 | BRNZP exit 41 | 42 | ; Ripristino il valore dei registri 43 | exit ADD R0, R4, #0 ; Salva il valore trovato in R0 44 | LD R2, saveR2 45 | LD R3, saveR3 46 | LD R4, saveR4 47 | RET ; Esci dalla subroutine 48 | 49 | char30 .fill x30 50 | 51 | saveR1 .blkw 1 52 | saveR2 .blkw 1 53 | saveR3 .blkw 1 54 | saveR4 .blkw 1 55 | 56 | N .fill 5 57 | C .fill x37 58 | .end 59 | 60 | 61 | -------------------------------------------------------------------------------- /conta_cifre/conta_cifre.asm: -------------------------------------------------------------------------------- 1 | ;******************************************************************** 2 | ; SOTTOPROGRAMMA DI CONTEGGIO NELL'ARRAY C DELLE CIFRE NELLA STRINGA S 3 | ; 4 | ; INPUT R0 = indirizzo inizio stringa S (0 terminatore) 5 | ; R1 = indirizzo inizio array C (10 elementi) 6 | ; 7 | ; OUTPUT C contiene il conteggi delle cifre da '0' a '9' presenti in S 8 | ;******************************************************************** 9 | 10 | .orig x3000 11 | LD R0, ptr1 12 | LEA R1, ptr2 13 | JSR count 14 | TRAP x25 15 | 16 | count 17 | 18 | ; Salvo il valore dei registri 19 | ST R2, saveR2 20 | ST R3, saveR3 21 | ST R4, saveR4 22 | ST R5, saveR5 23 | 24 | loop LDR R2, R0, #0 ; Leggo il carattere 25 | BRZ exit ; Se nullo esco 26 | LD R3, zero ; Carico il valore decimale di 0 27 | ADD R3, R2, R3 ; Confronto col il valore decimale di 0 28 | BRN next ; Se l'operazione � negativa il carattere letto non � un numero 29 | 30 | LD R3, nine ; Carico il valore decimale di 9 31 | ADD R3, R2, R3 ; Confronto col il valore decimale di 9 32 | BRP next ; Se l'operazione � positiva il carattere letto non � un numero 33 | 34 | BRNZP found ; Qui ho trovato un numero 35 | 36 | ; Numero trovato 37 | found ADD R3, R2, #0 ; In R3 c'� un numero N compreso fra 0 e 9 38 | ADD R4, R1, R3 ; Sommo all'indirizzo memorizzato in R1 il numero salvato in R3 39 | ; in modo da portarmi alla posizione dell'array C identificata dall'indirizzo memorizzato in R1[N] 40 | 41 | LDR R5, R4, #0 ; Mi porto ad R1[N] 42 | ADD R5, R5, #1 ; Incremento il valore 43 | BRNZP loop 44 | 45 | next ADD R0, R0, #1 ; Incremento di 1 l'indice 46 | BRNZP loop ; Eseguo di nuovo il ciclo 47 | 48 | ; Fine della subroutine 49 | exit LD R2, saveR2 ; Ripristino il valore dei registri 50 | LD R2, saveR2 51 | LD R4, saveR4 52 | LD R5, saveR5 53 | RET ; Esci dalla subroutine 54 | 55 | saveR2 .blkw #1 56 | saveR3 .blkw #1 57 | saveR4 .blkw #1 58 | saveR5 .blkw #1 59 | 60 | zero .fill -48 61 | nine .fill -57 62 | 63 | ptr1 .fill string 64 | ptr2 .blkw #10 65 | string .stringz "Oggi � il 13 settembre 2016, che si pu� scrivere anche 13/09/2016" 66 | .end 67 | -------------------------------------------------------------------------------- /conta_min_ug_mag/conta_min_ug_mag.asm: -------------------------------------------------------------------------------- 1 | ;************************************************************************** 2 | ; SOTTOPROGRAMMA DI CONTEGGIO DEL NUMERO DI VALORI MINORI, UGUALI E MAGGIORI 3 | ; DI UN VALORE PASSATO IN INGRESSO 4 | ; 5 | ; INPUT R0 = indirizzo inizio sequenza di numeri (0 terminatore) 6 | ; R1 = valore da confrontare 7 | ; OUTPUT R0 = conteggio dei numeri minori del valore di confronto 8 | ; R1 = conteggio dei numeri minori del valore di confronto 9 | ; R2 = conteggio dei numeri minori del valore di confronto 10 | ;************************************************************************** 11 | 12 | .orig x3000 13 | 14 | AND R0, R0, #0 15 | AND R1, R1, #0 16 | LEA R0, ptr ; Carico in R0 l'indirizzo della prima cella di memoria della sequenza 17 | LD R1, num ; Carico in R1 il numero da confrontare 18 | JSR COUNT ; Salto alla subroutine 19 | TRAP x25 20 | 21 | ; Salvo il valore dei registri 22 | COUNT 23 | ST R3, saveR3 24 | ST R4, saveR4 25 | ST R5, saveR5 26 | 27 | ; Inizializzo i registri necessari 28 | AND R3, R3, #0 ; Contatore numeri minori 29 | AND R4, R4, #0 ; Contatore numeri uguali 30 | AND R5, R5, #0 ; Contatore numero maggiori 31 | NOT R1, R1 32 | ADD R1, R1, #1 ; R1 = -R1 in modo da utilizzarlo per i confronti 33 | 34 | ; Inizio il confronto 35 | loop LDR R2, R0, #0 ; Carico il primo valore 36 | BRZ exit ; Se il valore � 0 esco dal ciclo 37 | ADD R2, R2, R1 ; R2 = R2 - R1 effettuo il confronto sommando i due valori 38 | BRN lower ; Se il risultato � negativo il numero della sequenza � minore 39 | BRZ equal ; Se il risultato � 0 i numeri sono uguali 40 | BRP greater ; Se il risultato � positivo il numerio della sequenza � maggiore 41 | 42 | lower ADD R3, R3, #1 ; Incremento il contatore dei numeri minori trovati 43 | BRNZP next 44 | 45 | equal ADD R4, R4, #1 ; Incremento il contatore dei numeri uguali trovati 46 | BRNZP next 47 | 48 | greater ADD R5, R5, #1 ; Incremento il contatore dei numeri maggiori trovati 49 | BRNZP next 50 | 51 | next ADD R0, R0, #1 ; Incremento il contatore del ciclo ed effettuo un'alta iterazione 52 | BRNZP loop 53 | 54 | ; Salvo i valori trovati 55 | exit ADD R0, R3, #0 56 | ADD R1, R4, #0 57 | ADD R2, R5, #0 58 | 59 | ; Ripristino i registri e torno dalla subroutine 60 | LD R3, saveR3 61 | LD R4, saveR4 62 | LD R5, saveR5 63 | RET 64 | 65 | ptr .blkw #7 66 | num .fill #-12 67 | 68 | saveR3 .blkw #1 69 | saveR4 .blkw #1 70 | saveR5 .blkw #1 71 | 72 | .end -------------------------------------------------------------------------------- /conta_volte/conta_volte.asm: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gabrieledarrigo/lc2-execises/29b6fdbbb99f6ff540cb3d6bee08b5d17197693c/conta_volte/conta_volte.asm -------------------------------------------------------------------------------- /count-char/count-char.asm: -------------------------------------------------------------------------------- 1 | ; 2 | ; Program to count occurrences of a character in a string. 3 | ; Character to be input from the keyboard. 4 | ; Result to be displayed on the monitor 5 | ; String in memory, to be terminated by NULL character (x0000) 6 | ; Program works only if no more than 9 occurrences are found 7 | ; 8 | ; 9 | ; Initialization 10 | ; 11 | .orig x3000 12 | AND R2,R2,#0 ; R2 is counter, initialize to 0 13 | LD R3,ptr ; R3 is pointer to characters in the string 14 | TRAP x23 ; R0 gets character input 15 | LDR R1,R3,#0 ; R1 gets first character in string 16 | ; 17 | ; Test character for end of string 18 | ; 19 | test BRZ outn ; test for NULL; if done, prepare to output 20 | ; 21 | ; Test character for match 22 | ; 23 | NOT R1,R1 24 | ADD R1,R1,R0 ; if match, R1 = xFFFF 25 | NOT R1,R1 ; if match, R1 = x0000 26 | BRNP getch ; if no match, skip the increment 27 | ADD R2,R2,#1 28 | ; 29 | ; Get next character from string 30 | ; 31 | getch ADD R3,R3,#1 ; increment the pointer 32 | LDR R1,R3,#0 ; R1 gets next character in string 33 | BR test ; loop to test character 34 | ; 35 | ; Output the count 36 | ; 37 | outn LD R0,ascii ; load the ASCII template for convert 38 | ADD R0,R0,R2 ; convert binary to ASCII 39 | TRAP x21 ; ASCII code in r0 is displayed 40 | TRAP x25 ; Halt machine 41 | ; 42 | ; Storage for pointer, ASCII template and string 43 | ; 44 | ascii .fill x0030 45 | ptr .fill file 46 | file .stringz "QUESTA E' LA STRINGA IN CUI CERCARE I CARATTERI" 47 | 48 | .end 49 | 50 | -------------------------------------------------------------------------------- /div/div.asm: -------------------------------------------------------------------------------- 1 | ;****************************************************************** 2 | ; 3 | ; SOTTOPROGRAMMA DI DIVISIONE INTERA DI DUE NUMERI INTERI POSITIVI 4 | ; 5 | ; INPUT R0 = dividendo N (Numeratore) 6 | ; R1 = divisore D (Denominatore) 7 | ; 8 | ; OUTPUT R0 = Q (intero arrotondato per difetto del quoziente Q=N/D) 9 | ; 10 | ;****************************************************************** 11 | 12 | .orig x3000 13 | LD R0, N 14 | LD R1, D 15 | JSR div 16 | TRAP x25 17 | 18 | ; Subroutine 19 | div ST R2, saveR2 20 | ST R3, saveR3 21 | ST R4, saveR4 22 | 23 | AND R2, R2, #0 ; R2 = 0, lo uso per salvare il valore del quoziente Q 24 | ADD R3, R1, #0 ; R3 = D, carico il divisore D in R3 25 | 26 | loop NOT R4, R3 27 | ADD R4, R4, #1 ; R4 = -D, ovvero il divisore D con segno negativo. 28 | 29 | ADD R4, R0, R4 ; Sottraggo il divisore D al numeratore N 30 | BRN found ; Se N - D < 0 allora ho trovato il quoziente Q 31 | ADD R2, R2, #1 ; Altrimento incremento il valore del quoziente Q 32 | ADD R3, R3, R1 ; Raddoppio il valore del divisore D salvato in R3 33 | BRNZP loop ; Continuo il ciclo 34 | 35 | found ADD R0, R2, #0 ; R0 = Q 36 | LD R2, saveR2 37 | LD R3, saveR3 38 | LD R4, saveR4 39 | RET 40 | 41 | saveR2 .blkw 1 42 | saveR3 .blkw 1 43 | saveR4 .blkw 1 44 | 45 | N .fill 100 46 | D .fill 6 47 | 48 | .end -------------------------------------------------------------------------------- /esercizio_1/esercizio_1.asm: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gabrieledarrigo/lc2-execises/29b6fdbbb99f6ff540cb3d6bee08b5d17197693c/esercizio_1/esercizio_1.asm -------------------------------------------------------------------------------- /esercizio_2/esercizio_2.asm: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/gabrieledarrigo/lc2-execises/29b6fdbbb99f6ff540cb3d6bee08b5d17197693c/esercizio_2/esercizio_2.asm -------------------------------------------------------------------------------- /io/IO.asm: -------------------------------------------------------------------------------- 1 | ; Programma che trasforma una lettera da maiuscola a minuscola 2 | .orig x3000 3 | TRAP x23 4 | LD R1,MA2mi 5 | ADD R0,R0,R1 6 | TRAP x21 7 | TRAP x25 8 | MA2mi .fill #32 9 | .end -------------------------------------------------------------------------------- /maiusc/maiusc.asm: -------------------------------------------------------------------------------- 1 | ;************************************************************ 2 | ; 3 | ; PROGRAMMA DI CONVERSIONE DI UNA STRINGA IN LETTERE MAIUSCOLE 4 | ; 5 | ; INPUT R0 = indirizzo inizio stringa 6 | ; 7 | ; OUTPUT R0 = conteggio delle lettere sostituite 8 | ; 9 | ;************************************************************ 10 | .orig x3000 11 | LD R0, ptr 12 | JSR upper 13 | TRAP x25 14 | 15 | ; Salvo il valore dei registri 16 | upper ST R1, saveR1 17 | ST R2, saveR2 18 | ST R3, saveR3 19 | ST R4, saveR4 20 | ST R5, saveR5 21 | 22 | ; Inizializzo i registri 23 | AND R1, R1, #0 ; R0 = 0, contatore lettere maiuscole trovate 24 | LD R2, lowerA ; codifica lettera minuscola a 25 | LD R3, lowerZ ; codifica lettera minuscola z 26 | LD R4, diff ; differenza minuscola - maiuscola 27 | 28 | ; Inizio il ciclo 29 | loop LDR R5, R0, #0 30 | BRZ finish ; Se il carattere � zero, esci 31 | ADD R6, R5, R2 ; Confronta con lettera minuscola a 32 | BRN next ; Se R5 - 97 � negativo non ho trovato una lettera minuscola 33 | ADD R6, R5, R3 ; Confronta con lettera minuscola z 34 | BRP next ; Se R5 - 122 � positivo non ho trovato una lettera minuscola 35 | BRNZP found ; In ogni altro caso ho trovato una minuscola 36 | 37 | ; Lettera minuscola trovata 38 | found ADD R1, R1, #1 ; Incremento il contatore delle lettere da sostituire 39 | ADD R5, R5, R4 ; Converto in maiuscola sommando il valore -32 40 | STR R5, R1, #0 ; Scrivo il valore nella cella R0[i] 41 | BRNZP next 42 | 43 | ; Incremento l'indice 44 | next ADD R0, R0, #1 45 | BRNZP loop ; Esegui nuovamente il ciclo 46 | 47 | 48 | ; Fine della subroutine 49 | finish ADD R0, R1, #0 ; Salvo il conteggio 50 | LD R1, saveR1 ; Ripristino i registri 51 | LD R2, saveR2 52 | LD R2, saveR3 53 | LD R4, saveR4 54 | LD R5, saveR5 55 | RET ; Esci dalla subroutine 56 | 57 | lowerA .fill -97 58 | lowerZ .fill -122 59 | diff .fill -32 60 | 61 | saveR1 .blkw #1 62 | saveR2 .blkw #1 63 | saveR3 .blkw #1 64 | saveR4 .blkw #1 65 | saveR5 .blkw #1 66 | 67 | ptr .fill string 68 | string .stringz "La sigla USA significa United States of America" 69 | .end -------------------------------------------------------------------------------- /minusc/minusc.asm: -------------------------------------------------------------------------------- 1 | ;************************************************************ 2 | ; 3 | ; PROGRAMMA DI CONVERSIONE DI UNA STRINGA IN LETTERE MINUSCOLE 4 | ; 5 | ; INPUT R0 = indirizzo inizio stringa 6 | ; 7 | ; OUTPUT R0 = conteggio delle lettere sostituite 8 | ; 9 | ;************************************************************ 10 | .orig x3000 11 | LD R0, ptr 12 | JSR lower 13 | TRAP x25 14 | 15 | ; Salvo il valore dei registri 16 | lower ST R1, saveR1 17 | ST R2, saveR2 18 | ST R3, saveR3 19 | ST R4, saveR4 20 | ST R5, saveR5 21 | 22 | ; Inizializzo i registri 23 | AND R1, R1, #0 ; R0 = 0, contatore lettere maiuscole trovate 24 | LD R2, upperA ; codifica lettera maiuscola A 25 | LD R3, upperZ ; codifica lettera maiuscola Z 26 | LD R4, diff ; differenza minuscola - maiuscola 27 | 28 | ; Inizio il ciclo 29 | loop LDR R5, R0, #0 30 | BRZ finish ; Se il carattere � zero, esci 31 | ADD R6, R5, R2 ; Confronta con lettera maiuscola A 32 | BRN next ; Se R5 - 90 � negativo non ho trovato una lettera maiuscola 33 | ADD R6, R5, R3 ; Confronta con lettera minuscola Z 34 | BRP next ; Se R5 - 122 � positivo non ho trovato una lettera maiuscola 35 | BRNZP found ; In ogni altro caso ho trovato una lettera maiuscola 36 | 37 | ; Lettera maiuscola trovata 38 | found ADD R1, R1, #1 ; Incremento il contatore delle lettere da sostituire 39 | ADD R5, R5, R4 ; Converto in minuscola sommando il valore 32 40 | STR R5, R1, #0 ; Scrivo il valore nella cella R0[i] 41 | BRNZP next 42 | 43 | ; Incremento l'indice 44 | next ADD R0, R0, #1 45 | BRNZP loop ; Esegui nuovamente il ciclo 46 | 47 | 48 | ; Fine della subroutine 49 | finish ADD R0, R1, #0 ; Salvo il conteggio 50 | LD R1, saveR1 ; Ripristino i registri 51 | LD R2, saveR2 52 | LD R2, saveR3 53 | LD R4, saveR4 54 | LD R5, saveR5 55 | RET ; Esci dalla subroutine 56 | 57 | upperA .fill -65 58 | upperZ .fill -90 59 | diff .fill 32 60 | 61 | saveR1 .blkw #1 62 | saveR2 .blkw #1 63 | saveR3 .blkw #1 64 | saveR4 .blkw #1 65 | saveR5 .blkw #1 66 | 67 | ptr .fill string 68 | string .stringz "USA significa" 69 | .end -------------------------------------------------------------------------------- /somma_se/somma_se.asm: -------------------------------------------------------------------------------- 1 | ;***************************************************************** 2 | ; 3 | ; PROGRAMMA DI CONTEGGIO E SOMMA DEI NUMERI UGUALI AL NUMERO N DATO 4 | ; 5 | ; INPUT R0 = indirizzo inizio primo array (0 terminatore) 6 | ; R1 = indirizzo inizio secondo array 7 | ; R2 = numero N 8 | ; 9 | ; OUTPUT R0 = somma dei numeri del secondo array in corrispondenza 10 | ; delle posizioni di N nel primo array 11 | ; 12 | ;***************************************************************** 13 | 14 | .orig x3000; 15 | LEA R0, ptr1 16 | LEA R1, ptr2 17 | LD R2, num 18 | JSR sum_se 19 | TRAP x25 20 | 21 | ; Salvo il valore dei registri 22 | sum_se ST R3, saveR3 23 | 24 | ; Inizializzo i registri necessari 25 | AND R3, R3, #0 ; R3 = 0, contiene la sommatoria 26 | NOT R2, R2 27 | ADD R2, R2, #1 ; R2 = -R2 in modo da effettuare il confronto 28 | 29 | ; Inizio il ciclo per trovare le posizioni uguali 30 | loop LDR R4, R0, #0 ; Carico il valore del primo array 31 | BRZ finish ; Se il valore � zero esco 32 | ADD R4, R4, R2 ; R4 = R4 - R2 33 | BRZ found ; Se il risultato � 0 ho trovato il numero 34 | BRNZP next ; Viceversa continuo il ciclo 35 | 36 | ; Ho trovato il numero nel primo array 37 | found LDR R5, R1, #0 ; Carico il valore del secondo array 38 | ADD R3, R3, R5 ; Sommo il numero alla sommatoria 39 | BRNZP next 40 | 41 | ; Muovo gli indici alla prossima posizione degli array 42 | next ADD R0, R0, #1 43 | ADD R1, R1, #1 44 | BRNZP loop ; Ciclo il prossimo valore 45 | 46 | ; Ripristino i registri ed esco dalla subroutine 47 | finish LD R3, saveR3 48 | RET 49 | 50 | saveR3 .blkw #1 51 | 52 | ptr1 .blkw #5 53 | ptr2 .blkw #5 54 | num .fill #15 55 | 56 | .end -------------------------------------------------------------------------------- /sommatoria_array/sommatoria_array.asm: -------------------------------------------------------------------------------- 1 | ;************************************************************************** 2 | ; SOTTOPROGRAMMA DI CALCOLO DELLA SOMMA PARZIALE DDEGLI ELEMENTI DI UN ARRAY 3 | ; 4 | ; INPUT R0 = indirizzo inizio array A (0 terminatore) 5 | ; R1 = indirizzo zona di memoria per array R DELLE SOMMATORIE 6 | ; 7 | ; OUTPUT R[i] = somma dei primi i elementi di A 8 | ; R[i] = 0 se traboccamento 9 | ;************************************************************************** 10 | 11 | .orig x3000 12 | LEA R0, ptr1 13 | LEA R1, ptr2 14 | JSR sum_arr 15 | TRAP x25 16 | 17 | ; Salvo il valore dei registri 18 | sum_arr ST R2, saveR2 19 | ST R3, saveR3 20 | ST R4, saveR4 21 | 22 | ; Inizializzo i registri 23 | AND R2, R2, #0 ; R2 = 0 24 | AND R3, R3, #0 ; R3 = 0 25 | AND R4, R4, #0 ; R4 = 0, contiene la somma di A[i] + A[i + 1] 26 | 27 | ; Inizio il ciclo 28 | loop LDR R2, R0, #0 ; Carico A[i] 29 | BRZ exit ; Se il numero � zero esco 30 | BRN neg ; Il primo numero caricato � negativo 31 | BRP pos ; Il primo numero caricato � positivo 32 | 33 | neg LDR R3, R0, #1 ; Carico A[i + 1] 34 | BRN under ; Il secondo numero � negativo, ci pu� essere underflow 35 | ADD R4, R2, R3 ; Il secondo numero � positivo, sommo 36 | STR R4, R1, #0 ; Salvo la somma in R[i] 37 | BRNZP next 38 | 39 | pos LDR R3, R0, #1 ; Carico A[i + 1] 40 | BRP over ; Il secondo numero � positivo, ci pu� essere overflow 41 | ADD R4, R2, R3 ; Il secondo numero � negativo sommo 42 | STR R4, R1, #0 ; Salvo la somma in R[i] 43 | BRNZP next 44 | 45 | under ADD R4, R2, R3 ; Sommo i valori 46 | BRP zero ; Se c'� underflow sommo 0 47 | STR R4, R1, #0 ; Salvo la somma in R[i] 48 | BRNZP next 49 | 50 | over ADD R4, R2, R3 ; Sommo i valori 51 | BRN zero ; Se c'� overflow salvo 0 52 | STR R4, R1, #0 ; Salvo la somma in R[i] 53 | BRNZP next 54 | 55 | zero AND R4, R4, #0 ; R4 = 0 56 | STR R4, R1, #0 ; Salvo 0 in R[i] 57 | BRNZP next 58 | 59 | next ADD R0, R0, #1 ; Incremento la posizione del puntatore ad A 60 | ADD R1, R1, #1 ; Incremento la posizione del puntatore ad R 61 | BRNZP loop ; Continuo il ciclo 62 | 63 | exit LD R2, saveR2 64 | LD R3, saveR3 65 | LD R4, saveR4 66 | RET 67 | 68 | saveR2 .blkw #1 69 | saveR3 .blkw #1 70 | saveR4 .blkw #1 71 | 72 | ptr1 .blkw #6 73 | ptr2 .blkw #6 74 | 75 | .end -------------------------------------------------------------------------------- /sommatoria_array/sommatoria_array_2.asm: -------------------------------------------------------------------------------- 1 | ;************************************************************************** 2 | ; SOTTOPROGRAMMA DI CALCOLO DELLA SOMMA PARZIALE DDEGLI ELEMENTI DI UN ARRAY 3 | ; 4 | ; INPUT R0 = indirizzo inizio array A (0 terminatore) 5 | ; R1 = indirizzo zona di memoria per array R DELLE SOMMATORIE 6 | ; 7 | ; OUTPUT R[i] = somma dei primi i elementi di A 8 | ; R[i] = 0 se traboccamento 9 | ;************************************************************************** 10 | 11 | .orig x3000 12 | LEA R0, ptr1 13 | LEA R1, ptr2 14 | JSR sum_arr 15 | TRAP x25 16 | 17 | ; Salvo il valore dei registri 18 | sum_arr ST R2, saveR2 19 | ST R3, saveR3 20 | 21 | ; Inizializzo i registri 22 | AND R2, R2, #0 ; R2 = 0 23 | AND R3, R3, #0 ; R3 = 0 24 | 25 | ; Inizio il ciclo 26 | loop LDR R2, R0, #0 ; Carico A[i] 27 | BRZ exit ; Se il numero � zero esco 28 | BRN neg ; Il primo numero caricato � negativo 29 | BRP pos ; Il primo numero caricato � positivo 30 | 31 | neg AND R3, R3, R3 ; Verifico il segno del secondo numero 32 | BRN under ; Il secondo numero � negativo, ci pu� essere underflow 33 | ADD R3, R2, R3 ; Il secondo numero � positivo, sommo 34 | STR R3, R1, #0 ; Salvo la somma in R[i] 35 | BRNZP next 36 | 37 | pos AND R3, R3, R3 ; Verifico il segno del secondo numero 38 | BRP over ; Il secondo numero � positivo, ci pu� essere overflow 39 | ADD R3, R2, R3 ; Il secondo numero � negativo sommo 40 | STR R3, R1, #0 ; Salvo la somma in R[i] 41 | BRNZP next 42 | 43 | under ADD R3, R2, R3 ; Sommo i due numeri 44 | BRP zero ; Se c'� underflow sommo 0 45 | STR R3, R1, #0 ; Salvo la somma in R[i] 46 | BRNZP next 47 | 48 | over ADD R3, R2, R3 ; Sommo i due numeri 49 | BRN zero ; Se c'� overflow salvo 0 50 | STR R3, R1, #0 ; Salvo la somma in R[i] 51 | BRNZP next 52 | 53 | zero AND R3, R3, #0 ; R3 = 0 54 | STR R3, R1, #0 ; Salvo la somma in R[i] 55 | BRNZP next 56 | 57 | next ADD R0, R0, #1 ; Incremento la posizione del puntatore ad A 58 | ADD R1, R1, #1 ; Incremento la posizione del puntatore ad R 59 | BRNZP loop ; Continuo il ciclo 60 | 61 | exit LD R2, saveR2 62 | LD R3, saveR3 63 | RET 64 | 65 | saveR2 .blkw #1 66 | saveR3 .blkw #1 67 | 68 | ptr1 .blkw #6 69 | ptr2 .blkw #6 70 | 71 | .end -------------------------------------------------------------------------------- /sum_two/sum_two.asm: -------------------------------------------------------------------------------- 1 | ; Somma di due numeri 2 | 3 | .orig x3000 ;Inizia in zona di memoria x3000 4 | LD R1, num1 5 | LD R2, num2 6 | ADD R0,R1,R2 7 | 8 | TRAP X21 9 | TRAP x25 10 | 11 | num1 .fill #1 12 | num2 .fill #1 13 | .end 14 | 15 | -------------------------------------------------------------------------------- /tipo_car/tipo_car.asm: -------------------------------------------------------------------------------- 1 | ;***************************************************************** 2 | ; SOTTOPROGRAMMA DI ANALISI DEL TIPO DI CARATTERE ASCII RICEVUTO 3 | ; 4 | ; INPUT R0 = carattere da analizzare (codice compreso fra 0 e 127) 5 | ; 6 | ; OUTPUT R1 = tipo del carattere: 7 | ; 1 = carattere di controllo (codice minore di 32) 8 | ; 2 = cifra (codice compreso fra 48 e 57) 9 | ; 3 = lettera maiuscola (codice compreso fra 65 e 90) 10 | ; 4 = lettera minuscola (codice compreso fra 97 e 122) 11 | ; 5 = altro simbolo 12 | ;***************************************************************** 13 | .orig x3000 14 | 15 | AND R0, R0, #0 ; R0 = 0 16 | LD R0, char ; Carica il carattere in R0 17 | JSR type 18 | TRAP x25 19 | 20 | ; Salvo il valore dei registri 21 | type ST R2, saveR2 22 | 23 | ;Inizializzo i registri necessari 24 | AND R1, R1, #0 25 | AND R2, R2, #0 26 | 27 | NOT R0, R0 28 | ADD R0, R0, #1 ; R0 = -R0 per effettuare confronti 29 | 30 | ; Controllo se � un carattere 31 | LD R2, ctrl 32 | ADD R2, R2, R0 ; R2 = R2 - R0 33 | BRZP control 34 | 35 | LD R2, zero 36 | ADD R2, R2, R0 ; R2 = R2 - R0 37 | BRP other 38 | 39 | ; Controllo se � un numero 40 | LD R2, nine 41 | ADD R2, R2, R0 ; R2 = R2 - R0 42 | BRZP number 43 | 44 | LD R2, lowerA 45 | ADD R2, R2, R0 ; R2 = R2 - R0 46 | BRP other 47 | 48 | ; Controllo se � una lettera minuscola 49 | LD R2, lowerZ 50 | ADD R2, R2, R0 ; R2 = R2 - R0 51 | BRZP lower 52 | 53 | LD R2, upperA 54 | ADD R2, R2, R0 ; R2 = R2 - R0 55 | BRP other 56 | 57 | ; Controllo se � una lettera maiuscola 58 | LD R2, upperZ 59 | ADD R2, R2, R0 ; R2 = R2 - R0 60 | BRZP upper 61 | BRNZP other ; E' qualcos'altro? 62 | 63 | 64 | control ADD R1, R1, #1 ; Trovato un carattere di controllo 65 | BRNZP exit 66 | 67 | number ADD R1, R1, #2 ; Trovato un numero 68 | BRNZP end 69 | 70 | lower ADD R1, R1, #3 ; Trovata una lettera minuscola 71 | BRNZP exit 72 | 73 | upper ADD R1, R1, #4 ; Trovata una lettera maiuscola 74 | BRNZP exit 75 | 76 | other ADD R1, R1, #5 ; Trovata un altro carattere 77 | BRNZP exit 78 | 79 | exit LD R2, saveR2 80 | ret 81 | 82 | ctrl .fill #31 83 | zero .fill #48 84 | nine .fill #57 85 | upperA .fill #54 86 | upperZ .fill #90 87 | lowerA .fill #97 88 | lowerZ .fill #122 89 | 90 | saveR2 .blkw #1 91 | char .blkw #1 92 | .end --------------------------------------------------------------------------------