Original https://github.com/swaroopch/byte-of-python
Rus translate http://wombat.org.ua/AByteOfPython/ (2.0.2)
huawei cro-u00 emui 4.1mini android 6.0 сохранить фото на sd карту | |
http://sms-mms-free.ru/phone/service/problem_memory/Huawei | |
https://www.mvideo.ru/products/smartfon-huawei-y3-2017-gold-cro-u00-30029366/reviews | |
Original https://github.com/swaroopch/byte-of-python
Rus translate http://wombat.org.ua/AByteOfPython/ (2.0.2)
|1 |14 неделя |Фил. 4:19 | | |
|2 |15 неделя |Иер. 29:11 | | |
|3 |16 неделя |Матф. 11:28-30| | |
|4 |17 неделя |Матф. 6:33 | | |
|5 |18 неделя |Ис. 41:10 | | |
|6 |19 неделя |Матф. 7:11 | | |
|7 |20 неделя | Матф. 7:7 | | |
|8 |21 неделя |1 Ин. 2:1 | | |
|9 |22 неделя |Евр. 7:25 | | |
|10|23 неделя |Пс. 31:8 | |
=begin | |
The goal here is to build a very simple compiler, for a very simple language. We will have very simple constructs for now like def f(x,y) add(42, add(x,y)) end, which says in English, define a function f that takes 2 arguments (x,y) and returns the return value of add(42, add(x, y)). This could easily be much more complex, but I wanted to keep things simple for high level understanding. Feel free to expand on this in your own languages 😉 | |
This code will consist of 3 main components: a lexer (or tokenizer), a parser, and a code generator. | |
Note that this code does NOT use the most efficient practices for compiler building, but rather the simplest approach for understanding purposes. | |
The simple version of this compiles the code down to python. feel free to test it! 😎 | |
While I do work in the system field, compiler design is not my area of expertise, and I referred to a number of written sources to put this together. |
=begin | |
The goal here is to build a very simple compiler, for a very simple language. We will have very simple constructs for now like def f(x,y) add(42, add(x,y)) end, which says in English, define a function f that takes 2 arguments (x,y) and returns the return value of add(42, add(x, y)). This could easily be much more complex, but I wanted to keep things simple for high level understanding. Feel free to expand on this in your own languages 😉 | |
This code will consist of 3 main components: a lexer (or tokenizer), a parser, and a code generator. | |
Note that this code does NOT use the most efficient practices for compiler building, but rather the simplest approach for understanding purposes. | |
The simple version of this compiles the code down to python. feel free to test it! 😎 | |
While I do work in the system field, compiler design is not my area of expertise, and I referred to a number of written sources to put this together. |
def bubbleSort(arr) | |
swapped = true | |
for i in 0 ... (arr.length - 1) | |
swapped = false | |
for j in 0 ... (arr.length - i - 1) | |
if arr[j] > arr[j + 1] | |
arr[j], arr[j + 1] = arr[j + 1], arr[j] | |
swapped = true | |
end | |
end |
Это есть первая задача, которой я занялся, делая этот сервер.
Причина? Просто я солидарен с этим мнением:
Я твердо уверен, что внедрить логирование в уже готовую программу без изменения архитектуры приложения – невозможно . Точнее внедрить можно, но тогда лог будет настолько страшным и неудобочитаемым, что остается посочувствовать тем администраторам, которые будут с ним работать.[1]