I. Nakata ([) and M. Sassa (Ap). Regular expressions with semantic rules and their application to data structure directed programs. Advances in Software Science and Technology, 3:93108, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....situation, and there is a limit to the number of optimizations which can be applied until the program code becomes unmaintainable. CHAPTER 2. SUBMATCH ADDRESSING FOR REGEXP MATCHING 11 2.3. 2 Nakata Sassa Semantic Rules Nakata and Sassa have proposed regular expressions with semantic rules [43], which can be used as tools for expressing the syntax and semantics of input data, and a method of generating programs for processing these input data. Their regular expressions can have intermixed semantic statements, which can conceivably be extended to implement submatch addressing instead of ....

.... nite number of n variables per state, the automaton generated from a regular expression of the form (a[f(a) n 1 z a : a does not work, because n 1 variables would be needed per state to implement a matcher using the Nakata Sassa method. All the algorithms given in their paper [43] also assume just one variable per state, and increasing the number of variables per state is only brie y mentioned. Also, Nakata and Sassa do CHAPTER 2. SUBMATCH ADDRESSING FOR REGEXP MATCHING 13 q 0 q 1 q 2 q 3 q 4 q 5 q 6 b a Figure 2.4: NFA for a ( jb) not discuss ....

I. Nakata ([) and M. Sassa (Ap). Regular expressions with semantic rules and their application to data structure directed programs. Advances in Software Science and Technology, 3:93108, 1991.

....nonconstant space, or some combination of these. For example, the GNU regexp 0.12 library consumes time exponentially on the regular expression (v ) j with input vvvvv . j. With an input of about 25 characters the matching takes tens of seconds on a modern workstation. Nakata and Sassa [8] have proposed a way of adding semantic rules to regular expressions and converting them to deterministic automata, but their algorithms do not resolve ambiguity and cannot handle situations where more than one application of the same semantic rule can be postponed at the same time. Of course, ....

....if speed is not essential. The automatabased approach is simpler and thus faster by up to several orders of magnitude, and in many cases more intuitively understandable for the user. For even simple regular expressions, several productions may be necessary to express the equivalent language. [8] I propose here an extension to traditional NFAs, tagged transitions, which allow us to store sufficient information of the path taken by the automaton while matching so that subexpression matching information, in the style of, for example POSIX.2 regexec, can be extracted with minimal work. We ....

I. Nakata and M. Sassa. Regular expressions with semantic rules and their application to data structure directed programs. Advances in Software Science and Technology, 3:93-- 108, 1991.

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