├── .gitignore
├── LICENSE
├── README.md
├── e1-example.txt
├── ex1.py
├── ex10.py
├── ex2.py
├── ex3.py
├── ex4.py
├── ex5.py
├── ex6.py
├── ex7.py
├── ex8.py
└── ex9.py
/.gitignore:
--------------------------------------------------------------------------------
1 | # Byte-compiled / optimized / DLL files
2 | __pycache__/
3 | *.py[cod]
4 | *$py.class
5 |
6 | # C extensions
7 | *.so
8 |
9 | # Distribution / packaging
10 | .Python
11 | build/
12 | develop-eggs/
13 | dist/
14 | downloads/
15 | eggs/
16 | .eggs/
17 | lib/
18 | lib64/
19 | parts/
20 | sdist/
21 | var/
22 | wheels/
23 | pip-wheel-metadata/
24 | share/python-wheels/
25 | *.egg-info/
26 | .installed.cfg
27 | *.egg
28 | MANIFEST
29 |
30 | # PyInstaller
31 | # Usually these files are written by a python script from a template
32 | # before PyInstaller builds the exe, so as to inject date/other infos into it.
33 | *.manifest
34 | *.spec
35 |
36 | # Installer logs
37 | pip-log.txt
38 | pip-delete-this-directory.txt
39 |
40 | # Unit test / coverage reports
41 | htmlcov/
42 | .tox/
43 | .nox/
44 | .coverage
45 | .coverage.*
46 | .cache
47 | nosetests.xml
48 | coverage.xml
49 | *.cover
50 | *.py,cover
51 | .hypothesis/
52 | .pytest_cache/
53 |
54 | # Translations
55 | *.mo
56 | *.pot
57 |
58 | # Django stuff:
59 | *.log
60 | local_settings.py
61 | db.sqlite3
62 | db.sqlite3-journal
63 |
64 | # Flask stuff:
65 | instance/
66 | .webassets-cache
67 |
68 | # Scrapy stuff:
69 | .scrapy
70 |
71 | # Sphinx documentation
72 | docs/_build/
73 |
74 | # PyBuilder
75 | target/
76 |
77 | # Jupyter Notebook
78 | .ipynb_checkpoints
79 |
80 | # IPython
81 | profile_default/
82 | ipython_config.py
83 |
84 | # pyenv
85 | .python-version
86 |
87 | # pipenv
88 | # According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control.
89 | # However, in case of collaboration, if having platform-specific dependencies or dependencies
90 | # having no cross-platform support, pipenv may install dependencies that don't work, or not
91 | # install all needed dependencies.
92 | #Pipfile.lock
93 |
94 | # PEP 582; used by e.g. github.com/David-OConnor/pyflow
95 | __pypackages__/
96 |
97 | # Celery stuff
98 | celerybeat-schedule
99 | celerybeat.pid
100 |
101 | # SageMath parsed files
102 | *.sage.py
103 |
104 | # Environments
105 | .env
106 | .venv
107 | env/
108 | venv/
109 | ENV/
110 | env.bak/
111 | venv.bak/
112 |
113 | # Spyder project settings
114 | .spyderproject
115 | .spyproject
116 |
117 | # Rope project settings
118 | .ropeproject
119 |
120 | # mkdocs documentation
121 | /site
122 |
123 | # mypy
124 | .mypy_cache/
125 | .dmypy.json
126 | dmypy.json
127 |
128 | # Pyre type checker
129 | .pyre/
130 |
--------------------------------------------------------------------------------
/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 | # MY COMPILER DESIGN LAB EXPERIMENTS/PROGRAMS
2 |
3 | ### Requirements
4 | 1. Python 3.6+
5 |
6 | ### How to Run?
7 | 1. Install Python 3.6+
8 | 2. Clone this repository
9 | 3. In command line type:
10 | ```
11 | python ex[exercise-number].py
12 | ```
13 |
14 | ### Experiments List
15 | - [Ex.1](ex1.py) - Lexical Analyzer
16 | - [Ex.2](ex2.py) - Regular Expression to NFA
17 | - [Ex.3](ex3.py) - Elimination of Left Recursion
18 | - [Ex.4](ex4.py) - Elimination of Left Factoring
19 | - [Ex.5](ex5.py) - Computation of First and Follow sets
20 | - [Ex.6](ex6.py) - Computation of Leading and Trailing sets
21 | - [Ex.7](ex7.py) - Construction of Predictive Parsing Table
22 | - [Ex.8](ex8.py) - Implementation of Shift Reduce Parsing
23 | - [Ex.9](ex9.py) - Computation of LR(0) items
24 | - [Ex.10](ex10.py) - Intermediate Code Generation: Three Address Code, Postfix, Prefix
25 |
--------------------------------------------------------------------------------
/e1-example.txt:
--------------------------------------------------------------------------------
1 | #include // This is a header file
2 | int main()
3 | {
4 | int a;
5 | a = 10;
6 | printf("The value of a is %d ",a);
7 | return 0;
8 | }
--------------------------------------------------------------------------------
/ex1.py:
--------------------------------------------------------------------------------
1 | keywords = {"auto","break","case","char","const","continue","default","do",
2 | "double","else","enum","extern","float","for","goto",
3 | "if","int","long","register","return","short","signed",
4 | "sizeof","static","struct","switch","typedef","union",
5 | "unsigned","void","volatile","while","printf","scanf","%d","include","stdio.h","main"}
6 |
7 | operators = {"+","-","*","/","<",">","=","<=",">=","==","!=","++","--","%"}
8 |
9 | delimiters = {'(',')','{','}','[',']','"',"'",';','#',',',''}
10 |
11 | def detect_keywords(text):
12 | arr = []
13 | for word in text:
14 | if word in keywords:
15 | arr.append(word)
16 | return list(set(arr))
17 |
18 | def detect_operators(text):
19 | arr = []
20 | for word in text:
21 | if word in operators:
22 | arr.append(word)
23 | return list(set(arr))
24 |
25 | def detect_delimiters(text):
26 | arr = []
27 | for word in text:
28 | if word in delimiters:
29 | arr.append(word)
30 | return list(set(arr))
31 |
32 | def detect_num(text):
33 | arr = []
34 | for word in text:
35 | try:
36 | a = int(word)
37 | arr.append(word)
38 | except:
39 | pass
40 | return list(set(arr))
41 | """
42 | this is original function for detecting identifier
43 | def is_identifier(token):
44 | if token[0] in numbers or token in keywords:
45 | return False
46 | else:
47 | return identifier(token)
48 |
49 | def identifier(token):
50 | if len(token)<2 and (token[0] in alphabets or token[0] in numbers or token[0] == "_"):
51 | return True
52 | elif token[0] in alphabets or token[0] in numbers or token[0] == "_":
53 | return identifier(token[1:])
54 | else:
55 | return False
56 | """
57 | def detect_identifiers(text):
58 | k = detect_keywords(text)
59 | o = detect_operators(text)
60 | d = detect_delimiters(text)
61 | n = detect_num(text)
62 | not_ident = k + o + d + n
63 | arr = []
64 | for word in text:
65 | if word not in not_ident:
66 | arr.append(word)
67 | return arr
68 |
69 | with open('e1-example.txt') as t:
70 | text = t.read().split()
71 |
72 | print("Keywords: ",detect_keywords(text))
73 | print("Operators: ",detect_operators(text))
74 | print("Delimiters: ",detect_delimiters(text))
75 | print("Identifiers: ",detect_identifiers(text))
76 | print("Numbers: ",detect_num(text))
--------------------------------------------------------------------------------
/ex10.py:
--------------------------------------------------------------------------------
1 | OPERATORS = set(['+', '-', '*', '/', '(', ')'])
2 | PRI = {'+':1, '-':1, '*':2, '/':2}
3 |
4 | ### INFIX ===> POSTFIX ###
5 | def infix_to_postfix(formula):
6 | stack = [] # only pop when the coming op has priority
7 | output = ''
8 | for ch in formula:
9 | if ch not in OPERATORS:
10 | output += ch
11 | elif ch == '(':
12 | stack.append('(')
13 | elif ch == ')':
14 | while stack and stack[-1] != '(':
15 | output += stack.pop()
16 | stack.pop() # pop '('
17 | else:
18 | while stack and stack[-1] != '(' and PRI[ch] <= PRI[stack[-1]]:
19 | output += stack.pop()
20 | stack.append(ch)
21 | # leftover
22 | while stack:
23 | output += stack.pop()
24 | print(f'POSTFIX: {output}')
25 | return output
26 |
27 | ### INFIX ===> PREFIX ###
28 | def infix_to_prefix(formula):
29 | op_stack = []
30 | exp_stack = []
31 | for ch in formula:
32 | if not ch in OPERATORS:
33 | exp_stack.append(ch)
34 | elif ch == '(':
35 | op_stack.append(ch)
36 | elif ch == ')':
37 | while op_stack[-1] != '(':
38 | op = op_stack.pop()
39 | a = exp_stack.pop()
40 | b = exp_stack.pop()
41 | exp_stack.append( op+b+a )
42 | op_stack.pop() # pop '('
43 | else:
44 | while op_stack and op_stack[-1] != '(' and PRI[ch] <= PRI[op_stack[-1]]:
45 | op = op_stack.pop()
46 | a = exp_stack.pop()
47 | b = exp_stack.pop()
48 | exp_stack.append( op+b+a )
49 | op_stack.append(ch)
50 |
51 | # leftover
52 | while op_stack:
53 | op = op_stack.pop()
54 | a = exp_stack.pop()
55 | b = exp_stack.pop()
56 | exp_stack.append( op+b+a )
57 | print(f'PREFIX: {exp_stack[-1]}')
58 | return exp_stack[-1]
59 |
60 | ### THREE ADDRESS CODE GENERATION ###
61 | def generate3AC(pos):
62 | print("### THREE ADDRESS CODE GENERATION ###")
63 | exp_stack = []
64 | t = 1
65 |
66 | for i in pos:
67 | if i not in OPERATORS:
68 | exp_stack.append(i)
69 | else:
70 | print(f't{t} := {exp_stack[-2]} {i} {exp_stack[-1]}')
71 | exp_stack=exp_stack[:-2]
72 | exp_stack.append(f't{t}')
73 | t+=1
74 |
75 | expres = input("INPUT THE EXPRESSION: ")
76 | pre = infix_to_prefix(expres)
77 | pos = infix_to_postfix(expres)
78 | generate3AC(pos)
--------------------------------------------------------------------------------
/ex2.py:
--------------------------------------------------------------------------------
1 | inp = "((e+a).b*)*"#input("")
2 | """
3 | Give your input in the above variable
4 | a and b are the only terminals accepted by this script
5 | e denotes epsilon
6 | . is used for "and" operation Eg. ab = a.b
7 | + is used for "or" operation Eg. a|b = a+b
8 | * is the Kleene's Closure operator. You can give star operator after any closing brackets and terminals
9 | """
10 |
11 |
12 | _="-"
13 |
14 | start = 1 # denotes start of e-nfa table
15 | end = 1 # denotes end of our table which is initially same as start
16 | cur = 1 # denotes current position of our pointer
17 | # this is intitial e-nfa table with only one state which is start and end both
18 | table = [["state","epsilon","a","b"],
19 | [1,_,_,_]]
20 |
21 | def print_t(table):
22 | """
23 | This function prints the e-nfa table
24 | """
25 | i = table[0]
26 | print(f'{i[0]: <10}'+f'| {i[1]: <10}'+f'| {i[2]: <10}'+f'| {i[3]: <10}')
27 | print("-"*46)
28 | for i in table[1:]:
29 | try:
30 | x = " ".join([str(j) for j in i[1]])
31 | except:
32 | x = ""
33 | try:
34 | y = " ".join([str(j) for j in i[2]])
35 | except:
36 | y = ""
37 | try:
38 | z = " ".join([str(j) for j in i[3]])
39 | except:
40 | z = ""
41 | print(f'{i[0]: <10}'+f'| {x: <10}'+f'| {y: <10}'+f'| {z: <10}')
42 |
43 | def e_(cur,ed=end):
44 | """
45 | this fuction adds epsilon to the table
46 | """
47 | temp = table[cur]
48 | try:
49 | table[cur] = [cur,temp[1].append(cur+1),temp[2],temp[3]]
50 | except:
51 | table[cur] = [cur,[cur+1],temp[2],temp[3]]
52 | try:
53 | nv = table([cur+1])
54 | except:
55 | table.append([ed+1,_,_,_])
56 | ed+=1
57 | return ed
58 |
59 |
60 | def a_(cur,ed=end):
61 | temp = table[cur]
62 | try:
63 | table[cur] = [cur,temp[1],temp[2].append(cur+1),temp[3]]
64 | except:
65 | table[cur] = [cur,temp[1],[cur+1],temp[3]]
66 | try:
67 | nv = table([cur+1])
68 | except:
69 | table.append([ed+1,_,_,_])
70 | ed+=1
71 | return ed
72 |
73 | def b_(cur,ed=end):
74 | temp = table[cur]
75 | try:
76 | table[cur] = [cur,temp[1],temp[2],temp[3].append(cur+1)]
77 | except:
78 | table[cur] = [cur,temp[1],temp[2],[cur+1]]
79 | try:
80 | nv = table([cur+1])
81 | except:
82 | table.append([ed+1,_,_,_])
83 | ed+=1
84 | return ed
85 |
86 | def or_b(cur,ed=end):
87 | temp = table[cur]
88 | try:
89 | table[cur] = [cur,temp[1],temp[2],temp[3].append(cur+1)]
90 | except:
91 | table[cur] = [cur,temp[1],temp[2],[cur+1]]
92 |
93 |
94 | def or_a(cur,ed=end):
95 | temp = table[cur]
96 | try:
97 | table[cur] = [cur,temp[1],temp[2].append(cur+1),temp[3]]
98 | except:
99 | table[cur] = [cur,temp[1],[cur+1],temp[3]]
100 |
101 | def and_a(cur,ed=end):
102 | cur+=1
103 | temp = table[cur]
104 | try:
105 | table[cur] = [cur,temp[1],temp[2].append(cur+1),temp[3]]
106 | except:
107 | table[cur] = [cur,temp[1],[cur+1],temp[3]]
108 | try:
109 | nv = table([cur+1])
110 | except:
111 | table.append([cur+1,_,_,_])
112 | ed+=1
113 | return cur,ed
114 |
115 | def and_b(cur,ed=end):
116 | cur+=1
117 | temp = table[cur]
118 | try:
119 | table[cur] = [cur,temp[1],temp[2],temp[3].append(cur+1)]
120 | except:
121 | table[cur] = [cur,temp[1],temp[2],[cur+1]]
122 | try:
123 | nv = table([cur+1])
124 | except:
125 | table.append([cur+1,_,_,_])
126 | ed+=1
127 | return cur,ed
128 |
129 | def star(cur,ed=end):
130 | table.append([ed+1,_,_,_])
131 | table.append([ed+2,_,_,_])
132 | ed+=2
133 | for i in range(cur,ed):
134 | temp = [table[ed-i+cur][0]]+table[ed-i+cur-1][1:4]
135 | for j in [1,2,3]:
136 | try:
137 | temp[j] = [x+1 for x in table[ed-i+cur-1][j]]
138 | except:
139 | pass
140 | table[ed-i+cur] = temp
141 | table[cur]=[cur,_,_,_]
142 |
143 | temp = table[cur]
144 | try:
145 | table[cur] = [temp[0],temp[1]+[cur+1,ed],temp[2],temp[3]]
146 | except:
147 | table[cur] = [temp[0],[cur+1,ed],temp[2],temp[3]]
148 |
149 | temp = table[ed-1]
150 | try:
151 | table[ed-1] = [temp[0],temp[1]+[cur+1,ed],temp[2],temp[3]]
152 | except:
153 | table[ed-1] = [temp[0],[cur+1,ed],temp[2],temp[3]]
154 |
155 | return ed-1,ed
156 |
157 |
158 | def mod_table(inp,start,cur,end,table):
159 | #print(inp)
160 | k = 0
161 | while k[[‘t’,’A'’],[‘b’]] means A -> tA' | b
8 | ##This above note for understanding output
9 |
10 |
11 | gram = {}
12 |
13 | def add(str): #to rules together
14 | str = str.replace(" ", "").replace(" ", "").replace("\n", "")
15 | x = str.split("->")
16 | y = x[1]
17 | x.pop()
18 | z = y.split("|")
19 | x.append(z)
20 | gram[x[0]]=x[1]
21 |
22 | def removeDirectLR(gramA, A):
23 | """gramA is dictonary"""
24 | temp = gramA[A]
25 | tempCr = []
26 | tempInCr = []
27 | for i in temp:
28 | if i[0] == A:
29 | #tempInCr.append(i[1:])
30 | tempInCr.append(i[1:]+[A+"'"])
31 | else:
32 | #tempCr.append(i)
33 | tempCr.append(i+[A+"'"])
34 | tempInCr.append(["e"])
35 | gramA[A] = tempCr
36 | gramA[A+"'"] = tempInCr
37 | return gramA
38 |
39 |
40 | def checkForIndirect(gramA, a, ai):
41 | if ai not in gramA:
42 | return False
43 | if a == ai:
44 | return True
45 | for i in gramA[ai]:
46 | if i[0] == ai:
47 | return False
48 | if i[0] in gramA:
49 | return checkForIndirect(gramA, a, i[0])
50 | return False
51 |
52 | def rep(gramA, A):
53 | temp = gramA[A]
54 | newTemp = []
55 | for i in temp:
56 | if checkForIndirect(gramA, A, i[0]):
57 | t = []
58 | for k in gramA[i[0]]:
59 | t=[]
60 | t+=k
61 | t+=i[1:]
62 | newTemp.append(t)
63 |
64 | else:
65 | newTemp.append(i)
66 | gramA[A] = newTemp
67 | return gramA
68 |
69 | def rem(gram):
70 | c = 1
71 | conv = {}
72 | gramA = {}
73 | revconv = {}
74 | for j in gram:
75 | conv[j] = "A"+str(c)
76 | gramA["A"+str(c)] = []
77 | c+=1
78 |
79 | for i in gram:
80 | for j in gram[i]:
81 | temp = []
82 | for k in j:
83 | if k in conv:
84 | temp.append(conv[k])
85 | else:
86 | temp.append(k)
87 | gramA[conv[i]].append(temp)
88 |
89 |
90 | #print(gramA)
91 | for i in range(c-1,0,-1):
92 | ai = "A"+str(i)
93 | for j in range(0,i):
94 | aj = gramA[ai][0][0]
95 | if ai!=aj :
96 | if aj in gramA and checkForIndirect(gramA,ai,aj):
97 | gramA = rep(gramA, ai)
98 |
99 | for i in range(1,c):
100 | ai = "A"+str(i)
101 | for j in gramA[ai]:
102 | if ai==j[0]:
103 | gramA = removeDirectLR(gramA, ai)
104 | break
105 |
106 | op = {}
107 | for i in gramA:
108 | a = str(i)
109 | for j in conv:
110 | a = a.replace(conv[j],j)
111 | revconv[i] = a
112 |
113 | for i in gramA:
114 | l = []
115 | for j in gramA[i]:
116 | k = []
117 | for m in j:
118 | if m in revconv:
119 | k.append(m.replace(m,revconv[m]))
120 | else:
121 | k.append(m)
122 | l.append(k)
123 | op[revconv[i]] = l
124 |
125 | return op
126 |
127 | n = int(input("Enter No of Production: "))
128 | for i in range(n):
129 | txt=input()
130 | add(txt)
131 |
132 | result = rem(gram)
133 |
134 | for x,y in result.items():
135 | print(f'{x} -> ', end="")
136 | for index, i in enumerate(y):
137 | for j in i:
138 | print(j, end="")
139 | if (index != len(y) - 1):
140 | print(" | ", end="")
141 | print()
142 |
143 |
--------------------------------------------------------------------------------
/ex4.py:
--------------------------------------------------------------------------------
1 | from itertools import takewhile
2 |
3 | s= "S->iEtS|iEtSeS|a"
4 |
5 | def groupby(ls):
6 | d = {}
7 | ls = [ y[0] for y in rules ]
8 | initial = list(set(ls))
9 | for y in initial:
10 | for i in rules:
11 | if i.startswith(y):
12 | if y not in d:
13 | d[y] = []
14 | d[y].append(i)
15 | return d
16 |
17 | def prefix(x):
18 | return len(set(x)) == 1
19 |
20 |
21 | starting=""
22 | rules=[]
23 | common=[]
24 | alphabetset=["A'","B'","C'","D'","E'","F'","G'","H'","I'","J'","K'","L'","M'","N'","O'","P'","Q'","R'","S'","T'","U'","V'","W'","X'","Y'","Z'"]
25 | s = s.replace(" ", "").replace(" ", "").replace("\n", "")
26 |
27 | while(True):
28 | rules=[]
29 | common=[]
30 | split=s.split("->")
31 | starting=split[0]
32 | for i in split[1].split("|"):
33 | rules.append(i)
34 |
35 | #logic for taking commons out
36 | for k, l in groupby(rules).items():
37 | r = [l[0] for l in takewhile(prefix, zip(*l))]
38 | common.append(''.join(r))
39 | #end of taking commons
40 | for i in common:
41 | newalphabet=alphabetset.pop()
42 | print(starting+"->"+i+newalphabet)
43 | index=[]
44 | for k in rules:
45 | if(k.startswith(i)):
46 | index.append(k)
47 | print(newalphabet+"->",end="")
48 | for j in index[:-1]:
49 | stringtoprint=j.replace(i,"", 1)+"|"
50 | if stringtoprint=="|":
51 | print("\u03B5","|",end="")
52 | else:
53 | print(j.replace(i,"", 1)+"|",end="")
54 | stringtoprint=index[-1].replace(i,"", 1)+"|"
55 | if stringtoprint=="|":
56 | print("\u03B5","",end="")
57 | else:
58 | print(index[-1].replace(i,"", 1)+"",end="")
59 | print("")
60 | break
61 |
--------------------------------------------------------------------------------
/ex5.py:
--------------------------------------------------------------------------------
1 | # #example for direct left recursion
2 | # gram = {"A":["Aa","Ab","c","d"]
3 | # }
4 | #example for indirect left recursion
5 | gram = {
6 | "E":["E+T","T"],
7 | "T":["T*F","F"],
8 | "F":["(E)","i"]
9 | }
10 |
11 | def removeDirectLR(gramA, A):
12 | """gramA is dictonary"""
13 | temp = gramA[A]
14 | tempCr = []
15 | tempInCr = []
16 | for i in temp:
17 | if i[0] == A:
18 | #tempInCr.append(i[1:])
19 | tempInCr.append(i[1:]+[A+"'"])
20 | else:
21 | #tempCr.append(i)
22 | tempCr.append(i+[A+"'"])
23 | tempInCr.append(["e"])
24 | gramA[A] = tempCr
25 | gramA[A+"'"] = tempInCr
26 | return gramA
27 |
28 |
29 | def checkForIndirect(gramA, a, ai):
30 | if ai not in gramA:
31 | return False
32 | if a == ai:
33 | return True
34 | for i in gramA[ai]:
35 | if i[0] == ai:
36 | return False
37 | if i[0] in gramA:
38 | return checkForIndirect(gramA, a, i[0])
39 | return False
40 |
41 | def rep(gramA, A):
42 | temp = gramA[A]
43 | newTemp = []
44 | for i in temp:
45 | if checkForIndirect(gramA, A, i[0]):
46 | t = []
47 | for k in gramA[i[0]]:
48 | t=[]
49 | t+=k
50 | t+=i[1:]
51 | newTemp.append(t)
52 |
53 | else:
54 | newTemp.append(i)
55 | gramA[A] = newTemp
56 | return gramA
57 |
58 | def rem(gram):
59 | c = 1
60 | conv = {}
61 | gramA = {}
62 | revconv = {}
63 | for j in gram:
64 | conv[j] = "A"+str(c)
65 | gramA["A"+str(c)] = []
66 | c+=1
67 |
68 | for i in gram:
69 | for j in gram[i]:
70 | temp = []
71 | for k in j:
72 | if k in conv:
73 | temp.append(conv[k])
74 | else:
75 | temp.append(k)
76 | gramA[conv[i]].append(temp)
77 |
78 |
79 | #print(gramA)
80 | for i in range(c-1,0,-1):
81 | ai = "A"+str(i)
82 | for j in range(0,i):
83 | aj = gramA[ai][0][0]
84 | if ai!=aj :
85 | if aj in gramA and checkForIndirect(gramA,ai,aj):
86 | gramA = rep(gramA, ai)
87 |
88 | for i in range(1,c):
89 | ai = "A"+str(i)
90 | for j in gramA[ai]:
91 | if ai==j[0]:
92 | gramA = removeDirectLR(gramA, ai)
93 | break
94 |
95 | op = {}
96 | for i in gramA:
97 | a = str(i)
98 | for j in conv:
99 | a = a.replace(conv[j],j)
100 | revconv[i] = a
101 |
102 | for i in gramA:
103 | l = []
104 | for j in gramA[i]:
105 | k = []
106 | for m in j:
107 | if m in revconv:
108 | k.append(m.replace(m,revconv[m]))
109 | else:
110 | k.append(m)
111 | l.append(k)
112 | op[revconv[i]] = l
113 |
114 | return op
115 |
116 | result = rem(gram)
117 |
118 |
119 | def first(gram, term):
120 | a = []
121 | if term not in gram:
122 | return [term]
123 | for i in gram[term]:
124 | if i[0] not in gram:
125 | a.append(i[0])
126 | elif i[0] in gram:
127 | a += first(gram, i[0])
128 | return a
129 |
130 | firsts = {}
131 | for i in result:
132 | firsts[i] = first(result,i)
133 | print(f'First({i}):',firsts[i])
134 | # temp = follow(result,i,i)
135 | # temp = list(set(temp))
136 | # temp = [x if x != "e" else "$" for x in temp]
137 | # print(f'Follow({i}):',temp)
138 |
139 | def follow(gram, term):
140 | a = []
141 | for rule in gram:
142 | for i in gram[rule]:
143 | if term in i:
144 | temp = i
145 | indx = i.index(term)
146 | if indx+1!=len(i):
147 | if i[-1] in firsts:
148 | a+=firsts[i[-1]]
149 | else:
150 | a+=[i[-1]]
151 | else:
152 | a+=["e"]
153 | if rule != term and "e" in a:
154 | a+= follow(gram,rule)
155 | return a
156 |
157 | follows = {}
158 | for i in result:
159 | follows[i] = list(set(follow(result,i)))
160 | if "e" in follows[i]:
161 | follows[i].pop(follows[i].index("e"))
162 | follows[i]+=["$"]
163 | print(f'Follow({i}):',follows[i])
--------------------------------------------------------------------------------
/ex6.py:
--------------------------------------------------------------------------------
1 | a = ["E=E+T",
2 | "E=T",
3 | "T=T*F",
4 | "T=F",
5 | "F=(E)",
6 | "F=i"]
7 |
8 | rules = {}
9 | terms = []
10 | for i in a:
11 | temp = i.split("=")
12 | terms.append(temp[0])
13 | try:
14 | rules[temp[0]] += [temp[1]]
15 | except:
16 | rules[temp[0]] = [temp[1]]
17 |
18 | terms = list(set(terms))
19 | print(rules,terms)
20 |
21 | def leading(gram, rules, term, start):
22 | s = []
23 | if gram[0] not in terms:
24 | return gram[0]
25 | elif len(gram) == 1:
26 | return [0]
27 | elif gram[1] not in terms and gram[-1] is not start:
28 | for i in rules[gram[-1]]:
29 | s+= leading(i, rules, gram[-1], start)
30 | s+= [gram[1]]
31 | return s
32 |
33 | def trailing(gram, rules, term, start):
34 | s = []
35 | if gram[-1] not in terms:
36 | return gram[-1]
37 | elif len(gram) == 1:
38 | return [0]
39 | elif gram[-2] not in terms and gram[-1] is not start:
40 |
41 | for i in rules[gram[-1]]:
42 | s+= trailing(i, rules, gram[-1], start)
43 | s+= [gram[-2]]
44 | return s
45 |
46 | leads = {}
47 | trails = {}
48 | for i in terms:
49 | s = [0]
50 | for j in rules[i]:
51 | s+=leading(j,rules,i,i)
52 | s = set(s)
53 | s.remove(0)
54 | leads[i] = s
55 | s = [0]
56 | for j in rules[i]:
57 | s+=trailing(j,rules,i,i)
58 | s = set(s)
59 | s.remove(0)
60 | trails[i] = s
61 |
62 | for i in terms:
63 | print("LEADING("+i+"):",leads[i])
64 | for i in terms:
65 | print("TRAILING("+i+"):",trails[i])
66 |
--------------------------------------------------------------------------------
/ex7.py:
--------------------------------------------------------------------------------
1 |
2 | # #example for direct left recursion
3 | # gram = {"A":["Aa","Ab","c","d"]
4 | # }
5 | #example for indirect left recursion
6 | gram = {
7 | "E":["E+T","T"],
8 | "T":["T*F","F"],
9 | "F":["(E)","i"]
10 | }
11 |
12 | def removeDirectLR(gramA, A):
13 | """gramA is dictonary"""
14 | temp = gramA[A]
15 | tempCr = []
16 | tempInCr = []
17 | for i in temp:
18 | if i[0] == A:
19 | #tempInCr.append(i[1:])
20 | tempInCr.append(i[1:]+[A+"'"])
21 | else:
22 | #tempCr.append(i)
23 | tempCr.append(i+[A+"'"])
24 | tempInCr.append(["e"])
25 | gramA[A] = tempCr
26 | gramA[A+"'"] = tempInCr
27 | return gramA
28 |
29 |
30 | def checkForIndirect(gramA, a, ai):
31 | if ai not in gramA:
32 | return False
33 | if a == ai:
34 | return True
35 | for i in gramA[ai]:
36 | if i[0] == ai:
37 | return False
38 | if i[0] in gramA:
39 | return checkForIndirect(gramA, a, i[0])
40 | return False
41 |
42 | def rep(gramA, A):
43 | temp = gramA[A]
44 | newTemp = []
45 | for i in temp:
46 | if checkForIndirect(gramA, A, i[0]):
47 | t = []
48 | for k in gramA[i[0]]:
49 | t=[]
50 | t+=k
51 | t+=i[1:]
52 | newTemp.append(t)
53 |
54 | else:
55 | newTemp.append(i)
56 | gramA[A] = newTemp
57 | return gramA
58 |
59 | def rem(gram):
60 | c = 1
61 | conv = {}
62 | gramA = {}
63 | revconv = {}
64 | for j in gram:
65 | conv[j] = "A"+str(c)
66 | gramA["A"+str(c)] = []
67 | c+=1
68 |
69 | for i in gram:
70 | for j in gram[i]:
71 | temp = []
72 | for k in j:
73 | if k in conv:
74 | temp.append(conv[k])
75 | else:
76 | temp.append(k)
77 | gramA[conv[i]].append(temp)
78 |
79 |
80 | #print(gramA)
81 | for i in range(c-1,0,-1):
82 | ai = "A"+str(i)
83 | for j in range(0,i):
84 | aj = gramA[ai][0][0]
85 | if ai!=aj :
86 | if aj in gramA and checkForIndirect(gramA,ai,aj):
87 | gramA = rep(gramA, ai)
88 |
89 | for i in range(1,c):
90 | ai = "A"+str(i)
91 | for j in gramA[ai]:
92 | if ai==j[0]:
93 | gramA = removeDirectLR(gramA, ai)
94 | break
95 |
96 | op = {}
97 | for i in gramA:
98 | a = str(i)
99 | for j in conv:
100 | a = a.replace(conv[j],j)
101 | revconv[i] = a
102 |
103 | for i in gramA:
104 | l = []
105 | for j in gramA[i]:
106 | k = []
107 | for m in j:
108 | if m in revconv:
109 | k.append(m.replace(m,revconv[m]))
110 | else:
111 | k.append(m)
112 | l.append(k)
113 | op[revconv[i]] = l
114 |
115 | return op
116 |
117 | result = rem(gram)
118 | terminals = []
119 | for i in result:
120 | for j in result[i]:
121 | for k in j:
122 | if k not in result:
123 | terminals+=[k]
124 | terminals = list(set(terminals))
125 | #print(terminals)
126 |
127 | def first(gram, term):
128 | a = []
129 | if term not in gram:
130 | return [term]
131 | for i in gram[term]:
132 | if i[0] not in gram:
133 | a.append(i[0])
134 | elif i[0] in gram:
135 | a += first(gram, i[0])
136 | return a
137 |
138 | firsts = {}
139 | for i in result:
140 | firsts[i] = first(result,i)
141 | # print(f'First({i}):',firsts[i])
142 |
143 | def follow(gram, term):
144 | a = []
145 | for rule in gram:
146 | for i in gram[rule]:
147 | if term in i:
148 | temp = i
149 | indx = i.index(term)
150 | if indx+1!=len(i):
151 | if i[-1] in firsts:
152 | a+=firsts[i[-1]]
153 | else:
154 | a+=[i[-1]]
155 | else:
156 | a+=["e"]
157 | if rule != term and "e" in a:
158 | a+= follow(gram,rule)
159 | return a
160 |
161 | follows = {}
162 | for i in result:
163 | follows[i] = list(set(follow(result,i)))
164 | if "e" in follows[i]:
165 | follows[i].pop(follows[i].index("e"))
166 | follows[i]+=["$"]
167 | # print(f'Follow({i}):',follows[i])
168 |
169 | resMod = {}
170 | for i in result:
171 | l = []
172 | for j in result[i]:
173 | temp = ""
174 | for k in j:
175 | temp+=k
176 | l.append(temp)
177 | resMod[i] = l
178 |
179 | # create predictive parsing table
180 | tterm = list(terminals)
181 | tterm.pop(tterm.index("e"))
182 | tterm+=["$"]
183 | pptable = {}
184 | for i in result:
185 | for j in tterm:
186 | if j in firsts[i]:
187 | pptable[(i,j)]=resMod[i][0]
188 | else:
189 | pptable[(i,j)]=""
190 | if "e" in firsts[i]:
191 | for j in tterm:
192 | if j in follows[i]:
193 | pptable[(i,j)]="e"
194 | pptable[("F","i")] = "i"
195 | toprint = f'{"": <10}'
196 | for i in tterm:
197 | toprint+= f'|{i: <10}'
198 | print(toprint)
199 | for i in result:
200 | toprint = f'{i: <10}'
201 | for j in tterm:
202 | if pptable[(i,j)]!="":
203 | toprint+=f'|{i+"->"+pptable[(i,j)]: <10}'
204 | else:
205 | toprint+=f'|{pptable[(i,j)]: <10}'
206 | print(f'{"-":-<76}')
207 | print(toprint)
208 |
--------------------------------------------------------------------------------
/ex8.py:
--------------------------------------------------------------------------------
1 | # example 1
2 | gram = {
3 | "E":["2E2","3E3","4"]
4 | }
5 | starting_terminal = "E"
6 | inp = "2324232$"
7 | """
8 | # example 2
9 | gram = {
10 | "S":["S+S","S*S","i"]
11 | }
12 | starting_terminal = "S"
13 | inp = "i+i*i"
14 | """
15 | stack = "$"
16 | print(f'{"Stack": <15}'+"|"+f'{"Input Buffer": <15}'+"|"+f'Parsing Action')
17 | print(f'{"-":-<50}')
18 |
19 | while True:
20 | action = True
21 | i = 0
22 | while i{gram[starting_terminal][i]}')
26 | i=-1
27 | action = False
28 | i+=1
29 | if len(inp)>1:
30 | stack+=inp[0]
31 | inp=inp[1:]
32 | print(f'{stack: <15}'+"|"+f'{inp: <15}'+"|"+f'Shift')
33 | action = False
34 |
35 | if inp == "$" and stack == ("$"+starting_terminal):
36 | print(f'{stack: <15}'+"|"+f'{inp: <15}'+"|"+f'Accepted')
37 | break
38 |
39 | if action:
40 | print(f'{stack: <15}'+"|"+f'{inp: <15}'+"|"+f'Rejected')
41 | break
--------------------------------------------------------------------------------
/ex9.py:
--------------------------------------------------------------------------------
1 | gram = {
2 | "S":["CC"],
3 | "C":["aC","d"]
4 | }
5 | start = "S"
6 | terms = ["a","d","$"]
7 |
8 | non_terms = []
9 | for i in gram:
10 | non_terms.append(i)
11 | gram["S'"]= [start]
12 |
13 |
14 | new_row = {}
15 | for i in terms+non_terms:
16 | new_row[i]=""
17 |
18 |
19 | non_terms += ["S'"]
20 | # each row in state table will be dictionary {nonterms ,term,$}
21 | stateTable = []
22 | # I = [(terminal, closure)]
23 | # I = [("S","A.A")]
24 |
25 | def Closure(term, I):
26 | if term in non_terms:
27 | for i in gram[term]:
28 | I+=[(term,"."+i)]
29 | I = list(set(I))
30 | for i in I:
31 | # print("." != i[1][-1],i[1][i[1].index(".")+1])
32 | if "." != i[1][-1] and i[1][i[1].index(".")+1] in non_terms and i[1][i[1].index(".")+1] != term:
33 | I += Closure(i[1][i[1].index(".")+1], [])
34 | return I
35 |
36 | Is = []
37 | Is+=set(Closure("S'", []))
38 |
39 |
40 | countI = 0
41 | omegaList = [set(Is)]
42 | while countI