作者: Intend 時(shí)間: 2025-3-21 21:17
Another solution of scoping problems in symbol tables,on. The algorithm is very simple so that the access time is not only (nearly) constant but also very small. The approach permits an efficient solution of all the scoping problems of contemporary programming languages such as MODULA-2, C, or Fortran90.作者: Adenoma 時(shí)間: 2025-3-22 04:09
Actress: An action semantics directed compiler generator,We report progress on the development of ., a compiler generator based on action semantics. It consists of a number of modules, written in SML, that can be composed to construct either an action notation compiler or a simple compiler generator. We also outline current and future developments that will improve the quality of the generated compilers.作者: 谷物 時(shí)間: 2025-3-22 07:47
https://doi.org/10.1007/978-3-658-31360-9signment property of variables. We give some example transformations and describe the input language of our tool called .. The relationship to similar work is discussed. Finally, experimental results are presented that demonstrate the efficiency of our approach.作者: 并入 時(shí)間: 2025-3-22 08:54 作者: 我悲傷 時(shí)間: 2025-3-22 14:42
https://doi.org/10.1007/978-3-319-18762-4esent the new implementation techniques developed for the generation of compiler front-ends from high-level identification specifications. The implementation combines instantiation and partial evaluation of expressions with a generated global table mechanism.作者: 我悲傷 時(shí)間: 2025-3-22 18:34 作者: Mobile 時(shí)間: 2025-3-22 21:52 作者: 口味 時(shí)間: 2025-3-23 03:45 作者: 山羊 時(shí)間: 2025-3-23 06:48
The Basic Physics of Spin-1 Systems,or show important reductions in automaton size in comparison with standard LR methods. Some discussion is presented, suggesting that the theoretical drawbacks of the method are of relatively little practical importance.作者: CHURL 時(shí)間: 2025-3-23 09:55
https://doi.org/10.1007/978-981-15-7929-5erminals, but also semantic functions and constructions of the syntax tree. In the module body the syntactic as well as the semantic rules are arranged. The set of already implemented modules can be reused for new applications. A short explanation of these ideas within the system FLR is given.作者: deforestation 時(shí)間: 2025-3-23 14:07 作者: conifer 時(shí)間: 2025-3-23 19:09 作者: expeditious 時(shí)間: 2025-3-23 23:31
https://doi.org/10.1007/978-3-658-28524-1raprocedural version. In particular, our stack-based approach generalizes the coincidence theorems of Barth and Sharir/Pnueli for the same setup, which do not properly deal with local variables of recursive procedures.作者: 捏造 時(shí)間: 2025-3-24 04:24
Dortmunder Beitr?ge zur Sozialforschungconstruction framework presented aims at minimizing the amount of handcoding during implementation and at reusing specification correctness arguments for proving the implementation correct. The classical technique of bootstrapping compilers is revisited with respect to implementation correctness.作者: IST 時(shí)間: 2025-3-24 06:56 作者: 左右連貫 時(shí)間: 2025-3-24 13:44 作者: 道學(xué)氣 時(shí)間: 2025-3-24 17:40
Another kind of modular attribute grammars,erminals, but also semantic functions and constructions of the syntax tree. In the module body the syntactic as well as the semantic rules are arranged. The set of already implemented modules can be reused for new applications. A short explanation of these ideas within the system FLR is given.作者: configuration 時(shí)間: 2025-3-24 21:45 作者: 盟軍 時(shí)間: 2025-3-25 00:25
Creation of a family of compilers and runtime environments by combining reusable components, well as runtime environments, can be created by a simple linking process out of components which have at most one dependency: either on the source language, or on the hardware, or on the operating system. It will be shown that the development costs for a whole family of language processor products can thus be reduced considerably.作者: Merited 時(shí)間: 2025-3-25 03:45
The interprocedural coincidence theorem,raprocedural version. In particular, our stack-based approach generalizes the coincidence theorems of Barth and Sharir/Pnueli for the same setup, which do not properly deal with local variables of recursive procedures.作者: micturition 時(shí)間: 2025-3-25 10:04 作者: tariff 時(shí)間: 2025-3-25 15:00
Testing completeness of code selector specifications,t of possible intermediate code trees. We use a tree grammar for this purpose. The paper first presents the algorithm for testing completeness. Afterwards implementation techniques are discussed. Finally results of practical experiments using the algorithm are given.作者: Herd-Immunity 時(shí)間: 2025-3-25 18:30
Conference proceedings 1992, October 5-7, 1992. Thepapers present recent developments on such topics asstructural and semantic analysis, code generation andoptimization, and compilation for parallelarchitectures andfor functional, logical, and application languages.作者: Axillary 時(shí)間: 2025-3-25 22:01 作者: 元音 時(shí)間: 2025-3-26 03:15
Conference proceedings 1992nstruction. Its scoperanges from compilation methods and tools toimplementationtechniques for specific requirements of languages andtargetarchitectures.This volume contains the papers selected forpresentation atthe 4th International Workshop on Compiler Construction,CC‘92, held in Paderborn, Germany作者: 摻假 時(shí)間: 2025-3-26 05:06 作者: 拉開這車床 時(shí)間: 2025-3-26 10:39 作者: 細(xì)胞學(xué) 時(shí)間: 2025-3-26 14:40 作者: 輕快來事 時(shí)間: 2025-3-26 20:48 作者: reception 時(shí)間: 2025-3-26 23:02 作者: 強(qiáng)行引入 時(shí)間: 2025-3-27 02:43 作者: 煩憂 時(shí)間: 2025-3-27 09:04
Instruction scheduling for complex pipelines, reduce structural hazards, too. Code with much instruction-level parallelism is optimized to avoid structural hazards, sequential code is scheduled for reducing data hazards. Embedded in a postpass strategy our scheduler removes 60 %–100 % of the removable stalls from conventionally scheduled code.作者: AV-node 時(shí)間: 2025-3-27 09:51 作者: 演講 時(shí)間: 2025-3-27 15:29
Generating LR(1) parsers of small size,automaton that combines the lookahead symbol with reading the parsing stack from its top, to determine the next parsing action. The building procedure for such a parser and its use for parsing are presented through an example grammar. Results from an experimental implementation of the parser generat作者: 赤字 時(shí)間: 2025-3-27 19:30
Syntax directed translation with LR parsing,o output operations within the action shift and reduce. A class of translation grammars, called R-translation grammars, is introduced as an extension of the class of postfix translation grammars. Transformations called shaking-down and postponing of output symbols are used for transformation of some作者: perimenopause 時(shí)間: 2025-3-28 01:25
Another kind of modular attribute grammars,ferent modules. The aim of our concept is the generation of special grammars in respect to the design decisions of a compiler writer. Therefore, a module represents a concrete syntactic or semantic design decision. The import- and export-interface of a module contains not only attributes of its nont作者: Allodynia 時(shí)間: 2025-3-28 02:47 作者: 頑固 時(shí)間: 2025-3-28 07:29 作者: 木質(zhì) 時(shí)間: 2025-3-28 13:55 作者: Induction 時(shí)間: 2025-3-28 15:29
Compiler implementation of ADTs using profile data,them is currently one of the early tasks in the design of a software system. While programming discipline and/or language features may allow the user to change implementations of an abstraction relatively easily, there remains the inherent problem of selecting a consistent and efficient set of imple作者: BAIL 時(shí)間: 2025-3-28 21:21 作者: 花束 時(shí)間: 2025-3-29 02:54 作者: COUCH 時(shí)間: 2025-3-29 03:11 作者: 礦石 時(shí)間: 2025-3-29 10:35 作者: Entropion 時(shí)間: 2025-3-29 12:36
Testing completeness of code selector specifications,selector specification. A specification is said to be complete, if it can produce code for every possible intermediate code tree produced by the front end..To enable a code generator generator to test the completeness property current code selector descriptions have to be extended to describe the se作者: 飛行員 時(shí)間: 2025-3-29 17:52 作者: sultry 時(shí)間: 2025-3-29 19:49 作者: 我不死扛 時(shí)間: 2025-3-30 03:10 作者: engagement 時(shí)間: 2025-3-30 05:00 作者: 疲憊的老馬 時(shí)間: 2025-3-30 11:27 作者: daredevil 時(shí)間: 2025-3-30 12:22
Challenging and Future Perspective,r testing interpreters/compilers of the developed language can be generated. LDL is based on GSFs — a kind of attribute grammars — and uses the denotational approach for semantics definition. For the prototype interpreter its correctness can be proved.作者: 記成螞蟻 時(shí)間: 2025-3-30 19:14 作者: 基因組 時(shí)間: 2025-3-31 00:40 作者: FOR 時(shí)間: 2025-3-31 04:38
The Basic Physics of Spin-1 Systems,o output operations within the action shift and reduce. A class of translation grammars, called R-translation grammars, is introduced as an extension of the class of postfix translation grammars. Transformations called shaking-down and postponing of output symbols are used for transformation of some作者: 夜晚 時(shí)間: 2025-3-31 08:52 作者: contrast-medium 時(shí)間: 2025-3-31 10:54 作者: 滔滔不絕地說 時(shí)間: 2025-3-31 13:31
https://doi.org/10.1007/978-3-319-18762-4techniques needed for the implementation of high-level identification specifications based on visibility rules. The underlying specification method is related to descriptions in language reports defining the identification in terms of validity and hiding of bindings in program ranges. This leads to 作者: sacrum 時(shí)間: 2025-3-31 19:00 作者: 王得到 時(shí)間: 2025-3-31 23:25
Springer Series in Surface Sciencesthem is currently one of the early tasks in the design of a software system. While programming discipline and/or language features may allow the user to change implementations of an abstraction relatively easily, there remains the inherent problem of selecting a consistent and efficient set of imple作者: 碌碌之人 時(shí)間: 2025-4-1 04:03 作者: 對(duì)手 時(shí)間: 2025-4-1 09:29
Uwe Eisenbeis,Andrea Bohne,Thomas Rauschonventional approach to software reuse — decoupling language specific front ends from hardware specific code generators by some common intermediate representation — proves to be insufficient. A larger set of decoupling interfaces can be defined such that all language processor products, compilers as作者: 衍生 時(shí)間: 2025-4-1 13:23
https://doi.org/10.1007/978-3-658-28524-1ndition for the equivalence of the . solution and the . solution to a data flow analysis problem. This generalization covers arbitrary imperative programs with recursive procedures, global and local variables, and formal value parameters. In the absence of procedures, it reduces to the classical int作者: 犬儒主義者 時(shí)間: 2025-4-1 16:58
Dortmunder Beitr?ge zur Sozialforschungtinction is drawn between correctness of the specification of a compiler and correctness of the actual implementation. The first covers semantical correctness of the code to be generated, whereas the second concerns correctness of the compiler program with respect to the specification. The compiler 作者: 細(xì)胞 時(shí)間: 2025-4-1 20:25
Kennzeichen und Bedeutung von Spin-offs,selector specification. A specification is said to be complete, if it can produce code for every possible intermediate code tree produced by the front end..To enable a code generator generator to test the completeness property current code selector descriptions have to be extended to describe the se作者: conception 時(shí)間: 2025-4-1 23:56
Spin-offs zur Durchführung von Innovationene a feasible and effective representation to characterize sequences of live ranges of variables in successive iterations of a loop. Based on this representation we provide a new heuristic algorithm for minimum register allocation, the . algorithm. In addition, we present a spilling algorithm that ma
