W. Yang, A lattice framework for analyzing context-free languages with applications in parser simplification and data-flow analysis, Journal of Information Science and Engineering (accepted), (1997).  Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Can We Always Adopt the Longest-Match Rule in a Scanner? - Yang (1997) Self-citation (Yang) (Correct)
....Though the c operator did not compute the exact intersection, it provides additional information relating the states of a finite automaton and the nonterminals of a context free grammar. This information is useful in simplifying the LR parser of the context free grammar as well as its parser [13]. 6. The complete detection algorithm Figure 5 is the complete conflict detection algorithm. It first computes the determinisitic Moore automaton for the set of regular expressions for tokens. Then each pair of accepting states of the automaton is examined for alternative partitionings when the ....
W. Yang, A lattice framework for analyzing context-free languages with applications in parser simplification and data-flow analysis, Journal of Information Science and Engineering (accepted), (1997).
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