Увійти

Готові списки джерел за темами / Compiling techniques

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Compiling techniques"

Автор: Grafiati

Опубліковано: 3 червня 2025

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Compiling techniques".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Compiling techniques"

1

Goos, Gerhard. "Issues in Compiling." JUCS - Journal of Universal Computer Science 7, no. (5) (2001): 410–19. https://doi.org/10.3217/jucs-007-05-0410.

Повний текст джерела

Анотація:

We consider the state of the art in compiler construction and where to go from here. Main topics are improved exploitation of present (and future) hardware features, the interaction between compiling techniques and processor design, and the use of compiling techniques in application areas such as component-based software engineering and software reengineering.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Tawk, Souheil, Maroun Abi Assaf, Joseph Constantin, Kablan Barbar, and Jacques Bou Abdo. "Applying Compiling Techniques in DTD Conversion." WSEAS TRANSACTIONS ON INFORMATION SCIENCE AND APPLICATIONS 21 (December 20, 2024): 547–57. https://doi.org/10.37394/23209.2024.21.51.

Повний текст джерела

Анотація:

In this paper, we propose to apply compilation techniques to Documents Type Definition (DTD). At the syntactic level, we create a context free grammar, denoted GDT D , for the set of all DTDs in order to generate them. The semantic level is defined by using attributes. Each nonterminal of GDT D is assigned a set of attributes and for each production of GDT D a set of attribute equations is defined. This DTD compilation process can be used in different domains. In this article, we provide an attribute grammar that can be used to eliminate unnecessary parentheses in element declarations in a DTD

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Lesbre, Dorian, and Matthieu Lemerre. "Compiling with Abstract Interpretation." Proceedings of the ACM on Programming Languages 8, PLDI (2024): 368–93. http://dx.doi.org/10.1145/3656392.

Повний текст джерела

Анотація:

Rewriting and static analyses are mutually beneficial techniques: program transformations change the intensional aspects of the program, and can thus improve analysis precision, while some efficient transformations are enabled by specific knowledge of some program invariants. Despite the strong interaction between these techniques, they are usually considered distinct. In this paper, we demonstrate that we can turn abstract interpreters into compilers, using a simple free algebra over the standard signature of abstract domains. Functor domains correspond to compiler passes, for which soundness

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Bondarenko, M. A. "Compiling bibliography lists for educational projects: Teaching techniques." Russian language at school 82, no. 1 (2021): 16–26. http://dx.doi.org/10.30515/0131-6141-2021-82-1-16-26.

Повний текст джерела

Анотація:

This paper presents specific approaches and techniques aimed at developing the skill of compiling bibliography lists for research and project works in schoolchildren. The applied methodology involved the observation method, analysis and synthesis of the obtained empirical data and the modelling method. The author of the paper introduces a variety of techniques: games; monitoring of finished project assignments, their assessment and review; elaboration of instructions, recommendations; gathering of negative language material; editing, etc. It is concluded that the development of this kind of ac

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Lee, PeiZong. "Techniques for compiling programs on distributed memory multicomputers." Parallel Computing 21, no. 12 (1995): 1895–923. http://dx.doi.org/10.1016/0167-8191(95)00052-6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Paek, Yunheung, and David A. Padua. "Compiling for Scalable Multiprocessors with Polaris." Parallel Processing Letters 07, no. 04 (1997): 425–36. http://dx.doi.org/10.1142/s0129626497000413.

Повний текст джерела

Анотація:

Due to the complexity of programming scalable multiprocessors with physically distributed memories, it is onerous to manually generate parallel code for these machines. As a consequense, there has been much research on the development of compiler techniques to simplify programming, to increase reliability, and to reduce development costs. For code generation, a compiler applies a number of transformations in areas such as data privatization, data copying and replication, synchronization, and data and work distribution. In this paper, we discuss our recent work on the development and implementa

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Kewei Wang Zhaozhong Li Liuyu, Li. "The Compiling Techniques For Quantified Airphoto Stand-Volume Tables." National Remote Sensing Bulletin, no. 1 (1986): 18–26. http://dx.doi.org/10.11834/jrs.1986004.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

MONGENET, CATHERINE. "DATA COMPILING FOR SYSTEMS OF UNIFORM RECURRENCE EQUATIONS." Parallel Processing Letters 04, no. 03 (1994): 245–57. http://dx.doi.org/10.1142/s0129626494000247.

Повний текст джерела

Анотація:

This paper presents techniques to compile systems of recurrence equations into parallel programs defined by a set of virtual processors connected via a regular network and by the communications between these processors. These techniques are founded on a dependency analysis. The data dependencies are automatically compiled either in local memory management or in communications between the virtual processors through send/receive channels.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Murtopo, Dwi, Winarno Winarno, and Idam Ragil Widianto Atmojo. "Analysis of Teacher Pedagogic Competence in Compiling HOTS-Based Learning Tools." Social, Humanities, and Educational Studies (SHES): Conference Series 7, no. 1 (2024): 71. http://dx.doi.org/10.20961/shes.v7i1.84276.

Повний текст джерела

Анотація:

<p><em>This study aims to: 1) determine the pedagogical competence of teachers in compiling HOTS-based learning tools; and 2) knowing the application of teacher pedagogic competence in compiling HOTS-based learning tools. The form and strategy of research used is qualitative research with a case study approach. Data collection techniques using the following methods: 1) interviews; 2) questionnaires; and 3) documentation. Data analysis techniques using the Miles &amp; Huberman model. The results of the study concluded that: 1) teacher pedagogic competence in compiling HOTS-based

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Neumann, Thomas. "Evolution of a compiling query engine." Proceedings of the VLDB Endowment 14, no. 12 (2021): 3207–10. http://dx.doi.org/10.14778/3476311.3476410.

Повний текст джерела

Анотація:

In 2011 we showed how to use dynamic code generation to process queries in a data-centric manner. This execution model can produce compact and efficient code and was successfully used by both our own systems and systems of other groups. As the systems become used in practice, additional techniques were developed for shortcomings that did arrive, including low-latency compilation, multi-threading support, and others. This paper gives an overview of the evolution of our query engine within in the last ten years, and points out which problem have to be tackled to bring a compiling system into pro

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Compiling techniques"

1

Cifuentes, Cristina. "Reverse compilation techniques." Thesis, Queensland University of Technology, 1994.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Leu, Ioan Tudor. "An empirical study of a novel technique : rationed-memory compiling." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33297.

Повний текст джерела

Анотація:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.<br>Includes bibliographical references (p. 61-63).<br>We present rationed-memory compiling, a new technique designed to reduce the memory consumption of programs. The technique lowers memory usage by decreasing the amount of memory that programs allocate, but not use actively. With rationed- memory compiling, whenever a program requests a memory block, the compiler returns a block smaller than the requested size. The compiler handles subsequent reads and writes to the memory blo

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Oukati, Sadegh Mahmoud. "Control of power electronic devices (FACTS) to enhance power system stability." Thesis, University of Strathclyde, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275177.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Barthelmann, Volker [Verfasser]. "Advanced compiling techniques to reduce RAM usage of static operating systems / vorgelegt von Volker Barthelmann." 2004. http://d-nb.info/972029427/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Compiling techniques"

1

Gladstone, A. Software to assist the teaching of compiling techniques. UMIST, 1996.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Society for the Study of Manga Techniques. How to draw manga: Vol. 2, compiling techniques. Graphic-sha, 1996.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Ravi, Sethi, and Ullman Jeffrey D. 1942-, eds. Compilers: Principles, techniques, and tools. Addison-Wesley, 1986.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Ravi, Sethi, and Ullman Jeffrey D. 1942-, eds. Compilers: Principles, techniques and tools. Addison-Wesley, 1986.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Sigarch, ed. PACT 2006: Proceedings of the Fifteenth International Conference on Parallel Architectures and Compilation Techniques : September 16-20, 2006, Seattle, Washington, USA. Association for Computing Machinery, 2006.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Sigarch, ed. PACT'08: Proceedings of the Seventeenth International Conference on Parallel Architectures and Compilation Techniques : Toronto, Ontario, Canada, October 25-29, 2008. Association for Computing Machinery, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

International, Conference on Parallel Architectures and Compilation Techniques (16th 2007 Brasov Romania). PACT 2007: 16th International Conference on Parallel Architectures and Compilation Techniques : 15-19 September, 2007, Brasov, Romania. IEEE Computer Society, 2007.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

International Conference on Parallel Architectures and Compilation Techniques (18th 2009 Raleigh, N. C.). PACT 2009: 18th International Conference on Parallel Architectures and Compilation Techniques : 12-16 September 2009, Raleigh, North Carolina, USA. IEEE Computer Society, 2009.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

International Conference on Parallel Architectures and Compilation Techniques (2002 Charlottesville, Va.). PACT 2002: 2002 International Conference on Parallel Architectures and Compilation Techniques : proceedings : 22-25 September, 2002, Charlottesville, Virginia, USA. IEEE Computer Society Press, 2002.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

International Conference on Parallel Architectures and Compilation Techniques (13th 2004 Antibes, France and Juan-les-Pins, France). 13th International Conference on Parallel Architectures and Compilation Techniques: (PACT 2004) : proceedings : Antibes Juan-les-Pins, France, September 29-October 3, 2004. IEEE Computer Society, 2004.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Compiling techniques"

1

Codescu, Mihai, Fulya Horozal, Aivaras Jakubauskas, Till Mossakowski, and Florian Rabe. "Compiling Logics." In Recent Trends in Algebraic Development Techniques. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37635-1_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Philippsen, Michael, and Walter F. Tichy. "Compiling for Massively Parallel Machines." In Code Generation — Concepts, Tools, Techniques. Springer London, 1992. http://dx.doi.org/10.1007/978-1-4471-3501-2_6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Alle, Mythri, Keshavan Varadarajan, Alexander Fell, S. K. Nandy, and Ranjani Narayan. "Compiling Techniques for Coarse Grained Runtime Reconfigurable Architectures." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00641-8_21.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Chiola, Giovanni. "Compiling Techniques for the Analysis of Stochastic Petri Nets." In Modeling Techniques and Tools for Computer Performance Evaluation. Springer US, 1989. http://dx.doi.org/10.1007/978-1-4613-0533-0_2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Subbarayan, Sathiamoorthy. "Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems." In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11493853_26.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Wang, Zhu. "View on Formal Compilation Techniques for Articles of Civil Code from the General Provisions of Civil Law." In On the Constitutionality of Compiling a Civil Code of China. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-7900-0_11.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Chen, Tzung-Shi, and Chih-Yung Chang. "Skewed Data Partition and Alignment Techniques for Compiling Programs on Distributed Memory Multicomputers." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-39999-2_10.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

DeGroot, Doug. "A technique for compiling execution graph expressions for restricted and-parallelism in logic programs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-18991-2_63.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Shimasaki, Masaaki. "Compiling Techniques for Supercomputers." In Advances in Software Science and Technology. Elsevier, 1993. http://dx.doi.org/10.1016/b978-0-12-037104-4.50007-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Mañas, José A., Joaquín Salvachúa, and Tomás de Miguel. "Tool Demonstration: A Cross Compiling Experiment: a PC Implementation of a LOTOS Spec." In Formal Description Techniques, IV. Elsevier, 1992. http://dx.doi.org/10.1016/b978-0-444-89402-1.50042-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Compiling techniques"

1

Englund, Dirk R. "Compiling Machine Intelligence on Optoelectronic Systems." In Laser Science. Optica Publishing Group, 2024. https://doi.org/10.1364/ls.2024.fth2a.1.

Повний текст джерела

Анотація:

The hardware limitations of conventional electronics in deep neural network (DNN) applications have spurred explorations into alternative architectures, including architectures using optical- and/or quantum- domain signal processing signal processing subroutines. This work investigates the scalability and performance metrics—such as throughput, energy consumption, and latency—of various such architectures, with a focus on recently developed hardware error correction techniques, in-situ training methods, initial field trials, as well as extensions into DNN-based inference on quantum signals wit

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Dodaro, Carmine, Giuseppe Mazzotta, and Francesco Ricca. "Blending Grounding and Compilation for Efficient ASP Solving." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/30.

Повний текст джерела

Анотація:

Answer Set Programming (ASP) is a widely recognized formalism for Knowledge Representation and Reasoning. Traditional ASP systems, that employ the ground and solve architecture, are subject to the grounding bottleneck (i.e., variable-elimination can exhaust all computational resources). Compilation-based approaches have recently demonstrated how grounding can be effectively bypassed by compiling rules into propagators that simulate them. However, compiling an entire ASP program is not always advantageous. In this paper, we present both a program rewriting technique and an algorithm for the com

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Chamberlain, Bradford L. "Compiling Chapel." In PACT '20: International Conference on Parallel Architectures and Compilation Techniques. ACM, 2020. http://dx.doi.org/10.1145/3410463.3414669.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Guo, Ziyu, Eddy Zheng Zhang, and Xipeng Shen. "Correctly Treating Synchronizations in Compiling Fine-Grained SPMD-Threaded Programs for CPU." In 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 2011. http://dx.doi.org/10.1109/pact.2011.62.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Ren, Bin, and Gagan Agrawal. "Compiling Dynamic Data Structures in Python to Enable the Use of Multi-core and Many-core Libraries." In 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 2011. http://dx.doi.org/10.1109/pact.2011.13.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Yu, Jinhui, Xinyu Luan, and Yu Sun. "An Automated Analytics Engine for College Program Selection using Machine Learning and Big Data Analysis." In 2nd International Conference on Machine Learning Techniques and NLP (MLNLP 2021). Academy and Industry Research Collaboration Center (AIRCC), 2021. http://dx.doi.org/10.5121/csit.2021.111417.

Повний текст джерела

Анотація:

Because of the differences in the structure and content of each website, it is often difficult for international applicants to obtain the application information of each school in time. They need to spend a lot of time manually collecting and sorting information. Especially when the information of the school may be constantly updated, the information may become very inaccurate for international applicants. we designed a tool including three main steps to solve the problem: crawling links, processing web pages, and building my pages. In compiling languages, we mainly use Python and store the cr

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Abadi, Eden, and Ronen I. Brafman. "Learning and Solving Regular Decision Processes." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/270.

Повний текст джерела

Анотація:

Regular Decision Processes (RDPs) are a recently introduced model that extends MDPs with non-Markovian dynamics and rewards. The non-Markovian behavior is restricted to depend on regular properties of the history. These can be specified using regular expressions or formulas in linear dynamic logic over finite traces. Fully specified RDPs can be solved by compiling them into an appropriate MDP. Learning RDPs from data is a challenging problem that has yet to be addressed, on which we focus in this paper. Our approach rests on a new representation for RDPs using Mealy Machines that emit a distri

Стилі APA, Harvard, Vancouver, ISO та ін.

8

De Giacomo, Giuseppe, Marco Favorito, Luca Iocchi, Fabio Patrizi, and Alessandro Ronca. "Temporal Logic Monitoring Rewards via Transducers." In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/89.

Повний текст джерела

Анотація:

In Markov Decision Processes (MDPs), rewards are assigned according to a function of the last state and action. This is often limiting, when the considered domain is not naturally Markovian, but becomes so after careful engineering of extended state space. The extended states record information from the past that is sufficient to assign rewards by looking just at the last state and action. Non-Markovian Reward Decision Processes (NRMDPs) extend MDPs by allowing for non-Markovian rewards, which depend on the history of states and actions. Non-Markovian rewards can be specified in temporal logic

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Davis, Thomas B. "Writing Better Research Reports." In ISTFA 2009. ASM International, 2009. http://dx.doi.org/10.31399/asm.cp.istfa2009p0171.

Повний текст джерела

Анотація:

Abstract In the world of failure analysis and material characterization, compiling a final report may not be on our priority project list yet we will discover that the layout, syntax, and format of our reports can have as large an impact on the reader as the data we have collected. In an industry where the transmission of valid and understandable information from the lab floor to the requestor is vital, it becomes necessary for each of us to search for resolution to this quandary. In answering the question of how can we write better research documents and reports, this paper will present resea

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Midorikawa, Edson Toshimi, and Liria Matsumoto Sato. "COMMUNION: towards a cooperative strategy for high-performance memory management." In Simpósio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho. Sociedade Brasileira de Computação, 1997. http://dx.doi.org/10.5753/sbac-pad.1997.22645.

Повний текст джерела

Анотація:

The memory system is the most critical component of modern high-performance computer systems, because of its growing inability to keep up with the processor requests. Technological trends have produced a large and growing gap between CPU speeds and DRAM speeds. Many researches have focused this memory system problem, including program optimizing techniques, data locality enhancement, hardware and software prefetching, decoupled architectures, mutithreading, speculative loads and execution. These techniques have achieved a relative suceess, but they focus only one component in the hardware or s

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Compiling techniques"

1

Greaves, C., and J. B. R. Eamer. Focus stacking for cataloguing, presentation, and identification of microfossils in marine sediments. Natural Resources Canada/CMSS/Information Management, 2023. http://dx.doi.org/10.4095/331355.

Повний текст джерела

Анотація:

Microfossils represent an important part of studying past depositional environments and determining ages for the strata they are found within. The key to ascribing paleoenvironmental interpretations to the sediments in which a microfossil is found is accurate identification of the microfossil. A number of techniques can be used to identify microfossils, including ones that use key features, morphologies, and characteristics from imagery acquired using a scanning electron microscope. A low-cost, efficient alternative method is digital photography of optical microscope images. This technical not

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Borgwardt, Stefan, Marcel Lippmann, and Veronika Thost. Temporal Query Answering w.r.t. DL-Lite-Ontologies. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.195.

Повний текст джерела

Анотація:

Ontology-based data access (OBDA) generalizes query answering in relational databases. It allows to query a database by using the language of an ontology, abstracting from the actual relations of the database. For ontologies formulated in Description Logics of the DL-Lite family, OBDA can be realized by rewriting the query into a classical first-order query, e.g. an SQL query, by compiling the information of the ontology into the query. The query is then answered using classical database techniques. In this report, we consider a temporal version of OBDA. We propose a temporal query language th

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!