| M. Harsu. Translation of conditional compilation. Nordic Journal of Computing, 6(1), Spring 1999. |
....because the source text is not a continuous stream of tokens of a legal program but rather a sequence of fragments that must be combined in certain ways to obtain one of several possible alternative programs. We introduce multi branch parsing, which enables parsing conditional compilation properly [46]. We have a converter translating PL M programs into C [44, 45, 81] The implementation tool of the converter is TaLE (Tampere Language Editor) 48, 49, 53, 54] We show how to exploit TaLE in di#erent translation actions. We have extended TaLE in order to enable piecewise translation and ....
....we consider the problem and give some example situations where the problem occurs. We introduce the basic idea to solve the problem, and consider the experiences of the solution. We also discuss related work concerning the problem. Finally, we give some concluding remarks. This chapter is based on [46]. 10.1 Parsing problem due to conditional compilation Implementing a source to source translator for a language enabling conditional compilation causes problems. In source to source translation, we cannot use any preprocessing, as in compiling. Instead, the converter should parse and translate ....
Harsu, M., Translation of conditional compilation, Nordic Journal of Computing 6 (1) 1999, 93--109.
....converter [12] we did not discuss the problem of translating conditional compilation at all. In [8] we tried to avoid the problem in usual cases by grammar transformations. In the present paper, we describe a more general solution. A more detailed version of the present paper can be found in [9]) This paper mainly considers the parsing phase of source to source translation. The actual translation process and translation choises are considered in other papers dealing with the PL M to C converter [12, 7, 8] However, this paper gives some translation examples including conditional ....
....to TaLE. TaLE originally had a parsing stack to which we have applied the main modifications. By using the parsing stack the parsing situations are easy to store and restore. However, multi branch parsing could also be implemented in recursive descent parsers having no explicit parsing stack [9]. These parsers have a parsing function for each nonterminal symbol of the language. The calling sequence of these functions forms an implicit run time stack containing the called procedures in the form of activation records. To implement multi branch parsing for these parsers, all the parsing ....
Harsu, M.: Translation of conditional compilation. Report A-1997-13, Department of Computer Science, University of Tampere.
No context found.
M. Harsu. Translation of conditional compilation. Nordic Journal of Computing, 6(1), Spring 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC