More Efficient Bottom-Up Multi-Pattern Matching in Trees

1992 ◽  
Author(s):  
J. Cai ◽  
R. Paige ◽  
R. Tarjan
Keyword(s):  
Pattern Matching ◽  
Bottom Up

scholarly journals Hierarchy Restructuring for Hierarchical LVS Comparison

VLSI Design ◽  
1999 ◽  
Vol 10 (1) ◽  
pp. 117-125 ◽  
Author(s):  
Wonjong Kim ◽  
Hyunchul Shin
Keyword(s):  
Pattern Matching ◽  
Experimental Results ◽  
Memory Usage ◽  
Comparison System ◽  
Bottom Up ◽  
Rule Based ◽  
Matching Algorithm ◽  
Cpu Time ◽  
Layout Verification ◽  
Comparison Technique

A new hierarchical layout vs. schematic (LVS) comparison system for layout verification has been developed. The schematic hierarchy is restructured to remove ambiguities for consistent hierarchical matching. Then the circuit hierarchy is reconstructed from the layout netlist by using a modified SubGemini algorithm recursively in bottom-up fashion. For efficiency, simple gates are found by using a fast rule-based pattern matching algorithm during preprocessing. Experimental results show that our hierarchical netlist comparison technique is effective and efficient in CPU time and in memory usage, especially when the circuit is large and hierarchically structured.

scholarly journals More efficient bottom-up multi-pattern matching in trees

1992 ◽  
Vol 106 (1) ◽  
pp. 21-60 ◽  
Author(s):  
J. Cai ◽  
R. Paige ◽  
R. Tarjan
Keyword(s):  
Pattern Matching ◽  
Bottom Up

DEALING WITH AMBIGUITIES IN ENGLISH CONJUNCTIONS AND COMPARATIVES BY A DETERMINISTIC PARSER

1990 ◽  
Vol 04 (04) ◽  
pp. 629-649 ◽  
Author(s):  
REY-LONG LIU ◽  
VON-WUN SOO
Keyword(s):  
Pattern Matching ◽  
Attention Shifting ◽  
Bottom Up ◽  
Adequate Information ◽  
Wait And See

The major problems in parsing English conjunctions and comparatives are ambiguities of scoping and ellipsis. Scoping ambiguities occur when a parser cannot deterministically detect boundaries of constituents, while ellipsis ambiguities occur when a parser cannot deterministically detect missing components. Since simple lookahead mechanisms cannot collect adequate information to resolve these ambiguities, a parsing strategy that only employs such mechanisms will need to backtrack each time it makes incorrect assumptions. In this paper, we extend the Wait-And-See strategy to parse conjunctions and comparatives deterministically and simultaneously. Several mechanisms, such as bottom-up preparsing, suspension, and pattern matching, are implemented. The bottom-up preparsing accesses the dictionary and recognizes isolated sentence fragments which can be determined without ambiguities. The suspension, which is different from Marcus’s attention shifting, allows the parser to suspend temporally at ambiguous points and continue to parse the rest of the sentence until it obtains the necessary information to resolve the ambiguities. Pattern matching uses the concept of symmetry to detect missing components (the ellipses) in the two conjoined or compared sentence fragments.

scholarly journals Efficient retargetable code generation using bottom-up tree pattern matching

1990 ◽  
Vol 15 (3) ◽  
pp. 127-140 ◽  
Author(s):  
A. Balachandran ◽  
D.M. Dhamdhere ◽  
S. Biswas
Keyword(s):  
Pattern Matching ◽  
Code Generation ◽  
Bottom Up ◽  
Tree Pattern ◽  
Tree Pattern Matching

Psychology and Culture: Top Down Versus Bottom Up?

PsycCRITIQUES ◽  
2005 ◽  
Vol 50 (19) ◽  
Author(s):  
Michael Cole
Keyword(s):  
Top Down ◽  
Bottom Up
Sign in / Sign up

Export Citation Format

Share Document