cytron

cytron
m IV, D. -u, Ms. \cytronnie; lm M. -y
bot. «Citrus medica, drzewo lub krzew o wiecznie zielonych liściach, białych kwiatach i dużych, żółtych owocach w twardej, chropawej skórce, z której robi się cykatę i wydobywa olejek eteryczny»

Słownik języka polskiego . 2013.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Cytron — Screenshot from the first level. Cytron is a computer game for the Amiga, released by Psygnosis. Cytron is a futuristic Gauntlet type maze action/adventure game. The story tells that on a distant research facility, the robots serving the… …   Wikipedia

  • Cytron —  Pour l’article homophone, voir Citron. Cytron Éditeur …   Wikipédia en Français

  • cytron — vaistinis citrinmedis statusas T sritis vardynas apibrėžtis Rūtinių šeimos dekoratyvinis, maistinis, prieskoninis, vaistinis augalas (Citrus medica), kilęs iš Indijos. Jo vaisiai valgomi; kvapiosios medžiagos naudojamos maisto pramonėje. Augalas… …   Lithuanian dictionary (lietuvių žodynas)

  • Cytron Masters — Developer(s) Ozark Softscape Publisher(s) SSI Desi …   Wikipedia

  • Banpresto Originals Terminology — This article relates to the terminology used in the Banpresto Super Robot Wars metaseries. Technology Aegis Plan/Aegis System Originally designed by the Divine Crusaders as an extensive defense network to ward off an extreme alien attacks, the… …   Wikipedia

  • Real-time strategy — A real time strategy (RTS) video game is a strategic game that is distinctly not turn based. [cite web |url=http://www.gamespot.com/gamespot/features/all/real time/ |title=A History of Real Time Strategy Games |accessdate=2008 03 31 |author=Bruce …   Wikipedia

  • Static single assignment form — In compiler design, static single assignment form (often abbreviated as SSA form or SSA) is an intermediate representation (IR) in which every variable is assigned exactly once. Existing variables in the original IR are split into versions , new… …   Wikipedia

  • Dominator (graph theory) — For Dominating set problem, see Dominating set. In computer science, in control flow graphs, a node d dominates a node n if every path from the start node to n must go through d. Notationally, this is written as d dom n (or sometimes d n). By… …   Wikipedia

  • Dead code elimination — In compiler theory, dead code elimination is a compiler optimization to remove code which does not affect the program results. Removing such code has two benefits: it shrinks program size, an important consideration in some contexts, and it… …   Wikipedia

  • PLDI — Programming Language Design and Implementation (PLDI) is the name of one of the ACM SIGPLAN s most important conferences. The precursor of PLDI was the Symposium on Compiler Optimization , held July 27 ndash;28, 1970 at the University of Illinois …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”