کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6873891 | 1440710 | 2018 | 53 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Analyzing pushdown systems with stack manipulation
ترجمه فارسی عنوان
تجزیه و تحلیل سیستم های کم فشار با دستکاری پشته
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
چکیده انگلیسی
Pushdown systems with transductions (TrPDSs) are an extension of pushdown systems (PDSs) by associating each transition rule with a transduction, which allows to inspect and modify the stack content at each step of a transition rule. In this work, we propose two novel saturation procedures to compute preâ(C) and postâ(C) for finite TrPDSs. From these two saturation procedures, we present two algorithms to compute preâ(C) and postâ(C) that are suitable for implementation. We also show that the algorithms for computing preâ(C) and postâ(C) also work for weak finite TrPDSs, where closure is defined with respect to the underlying PDSs. These results are extended to left contextual TrPDSs, which is an extension of finite TrPDSs. Finally, we show how the presence of transductions enables the modeling of Boolean programs with call-by-reference parameter passing and low-level assembly programs that manipulate the program stack content via a stack pointer.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information and Computation - Volume 259, Part 1, April 2018, Pages 41-71
Journal: Information and Computation - Volume 259, Part 1, April 2018, Pages 41-71
نویسندگان
Fu Song,