검색어: preorder (영어 - 아랍어)

preorder
طلب مسبق

just make sure you preorder the molten chocolate cake.
فقط تأكدي من طلبك (كعكة الشكلاطة الذائبة)

that there is a video game worth a preorder.
هذه ستكون لعبة فيديو تستحق الطلب المسبق.

- sir kyle, preorder doesn't mean shit, okay?
pre order سير كايل، لايعني شئ ، حسنا ؟

- yeah, but why can't xbox automatically let you preorder metal gear solid 5?
xbox نعم، ولكن لماذا لا يمكن لي تتيح لك تلقائيا metalgearsolid5preorder ؟

on the other hand, any monoid can be understood as a special sort of category, and so can any preorder.
من ناحيةٍ أخرى، يمكن فهم أي مونويد على أنه نوعٌ خاص من الفئة، وهكذا يكون أي تسلسل.

i have to preorder our duck... uh, slow-roasted, it takes six hours, falls off the bone.
يجب أن أطلب البطة مقدمًا. الطهي البطئ، يستغرق 6 ساعات لينتهي.

preorder the next death race now and you'll not only get 20% off, but you'll also receive limited edition frankenstein merchandise.
إطلب مسبقاً سباق الموت التالي الآن ولن تحصل على خصم 20% فقط بل ستحصل أيضاً على نسخة محدودة "من عرض شخصية "فرانكشتاين

a top-down parsing algorithm parses an input string of tokens by tracing out die steps in a leftmost derivation. such an algorithm is called top-down because die implied traversal of the parse tree is a preorder traversal and, thus, occurs from the root to die leaves (see section 3.3 of chapter 3). top-down parsers come in two forms: backtracking parsers and predictive parsers. a predictive parser attempts to predict the next construction in the input string using one or more lookahead tokens, while a backtracking parser will try different possibilities for a parse of the input, backing up an arbitrary amount in the input if one possibility foils. while backtracking parsers are more powerful than predictive parsers, they are also much slower, requiring exponential time in general and, therefore, are unsuitable for practical compilers. we do not study backtracking parsers here (but see the note and references section and the exercise for a few hints and pointers on this topic). the two kinds of top-down parsing algorithms that we do study here are called recursive-descent parsing and ll(1) parsing. recursive-descent parsing is quite versatile and is the most suitable method for a handwritten parser, so we study it first ll(1) parsing is studied next; while it is no longer often used in practice, it is useful to study as a simple scheme with an explicit stack, and it may serve as a prelude to the more powerful (but also more complex) bottom-up algorithms of the next chapter, it also aids in formalizing some of the problems that appear in recursive-descent the il(1) parsing method gets its name as follows. the first “l” refers to the bet that it processes die input from left to right (some old parsers used to process input from right to left, but it is unusual today). the second “l” refers to the fact that it traces out a leftmost derivation for the input suing. the number 1 in parentheses means that it uses only one symbol of input to predict the direction of the parse. (it is also possible to have ll(fc) parsing, using k symbols of lookahead, and we study this briefly later in the chapter, but one symbol of look¬ahead is the most common case.)
لقد قدمنا تعريفًا للتعبيرات النمطية التي تستخدم الحد الأدنى من مجموعة العمليات المشتركة بين جميع التطبيقات ، ويمكننا أن نقتصر على استخدام العمليات الأساسية الثلاث فقط (مع الأقواس) في جميع الأمثلة. ومع ذلك ، فقد رأينا بالفعل في الأمثلة حتى الآن أن كتابة التعبيرات العادية باستخدام هذه العوامل فقط تكون أحيانًا غير عملية ، مما يؤدي إلى إنشاء تعبيرات عادية أكثر تعقيدًا مما قد تكون عليه في حالة توفر مجموعة عمليات أكثر تعبيرًا.