FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2062184115> ?p ?o ?g. }

• W2062184115 abstract "There is a wide range of applications for string processing and SNOBOL4 (Griswold, et al. [1971]) has come to be the most widely implemented and accepted language for such applications. No doubt one of the principle reasons for this acceptance is the data structure around which the language is organized, the string pattern. This structure together with the associated pattern matching process provide great flexibility. Nevertheless it has been widely recognized in informal terms that the pattern matching process is often grossly inefficient (Ripley & Griswold [1975], Dewar & McCann [1977]) and that the pattern structure is notoriously difficult to explain and use (Ripley & Griswold [1975], Stewart [1975]). Each of these areas of difficulty relates to such things as two modes of operation (quick-full scan), problems with left-recursion, heuristics in the scan, etc. Some difficulties are inherent with string patterns but many are not; we feel the developments described here help to clarify this situation.In section 2 we describe the formal model upon which we base this work. This allows the careful analysis of the variety of sets of strings which may be specified by the patterns which we admit and deduction to be made concerning the possibility/impossibility of algorithms of interest. With SNOBOL4 it has been the case that the careful definition of the meaning of a pattern is in terms of the actions taken by the pattern matching algorithm. This has led to the incorporation of idiosyncrasies of a particular algorithm into the understanding of the pattern structure. This seems akin to using a compiler as the definition of a programming language and we believe it is important to future progress to have other alternatives.In section 3 we point out that the worst-case execution time of the usual SNOBOL pattern matching algorithm is exponential in the length of the subject string, even on some quite simple patterns. We then present an algorithm whose worst-case time is polynomial and that operates on patterns which include a true set complement operator. As side benefits we find that the algorithm is not multi-modal and correctly handles the null string as an alternative and left-recursion.In order to conserve space we will assume throughout this paper that the reader is familiar with the idea of a string pattern in the sense that it is described in Griswold et al. [1971]. Also it is probably necessary that the reader have some general knowledge of the formal languages area." @default.
• W2062184115 created "2016-06-24" @default.
• W2062184115 creator A5022387316 @default.
• W2062184115 creator A5084614667 @default.
• W2062184115 date "1979-01-01" @default.
• W2062184115 modified "2023-10-14" @default.
• W2062184115 title "String pattern matching in polynomial time" @default.
• W2062184115 cites W1538935696 @default.
• W2062184115 cites W2023513252 @default.
• W2062184115 cites W2036308939 @default.
• W2062184115 cites W2061490122 @default.
• W2062184115 cites W2084813821 @default.
• W2062184115 cites W2134495021 @default.
• W2062184115 cites W2159951380 @default.
• W2062184115 cites W2788696937 @default.
• W2062184115 cites W3003374142 @default.
• W2062184115 doi "https://doi.org/10.1145/567752.567773" @default.
• W2062184115 hasPublicationYear "1979" @default.
• W2062184115 type Work @default.
• W2062184115 sameAs 2062184115 @default.
• W2062184115 citedByCount "2" @default.
• W2062184115 crossrefType "proceedings-article" @default.
• W2062184115 hasAuthorship W2062184115A5022387316 @default.
• W2062184115 hasAuthorship W2062184115A5084614667 @default.
• W2062184115 hasConcept C105795698 @default.
• W2062184115 hasConcept C11413529 @default.
• W2062184115 hasConcept C134306372 @default.
• W2062184115 hasConcept C154945302 @default.
• W2062184115 hasConcept C157486923 @default.
• W2062184115 hasConcept C165064840 @default.
• W2062184115 hasConcept C311688 @default.
• W2062184115 hasConcept C33923547 @default.
• W2062184115 hasConcept C37914503 @default.
• W2062184115 hasConcept C41008148 @default.
• W2062184115 hasConcept C68859911 @default.
• W2062184115 hasConcept C7757238 @default.
• W2062184115 hasConcept C80444323 @default.
• W2062184115 hasConcept C90119067 @default.
• W2062184115 hasConceptScore W2062184115C105795698 @default.
• W2062184115 hasConceptScore W2062184115C11413529 @default.
• W2062184115 hasConceptScore W2062184115C134306372 @default.
• W2062184115 hasConceptScore W2062184115C154945302 @default.
• W2062184115 hasConceptScore W2062184115C157486923 @default.
• W2062184115 hasConceptScore W2062184115C165064840 @default.
• W2062184115 hasConceptScore W2062184115C311688 @default.
• W2062184115 hasConceptScore W2062184115C33923547 @default.
• W2062184115 hasConceptScore W2062184115C37914503 @default.
• W2062184115 hasConceptScore W2062184115C41008148 @default.
• W2062184115 hasConceptScore W2062184115C68859911 @default.
• W2062184115 hasConceptScore W2062184115C7757238 @default.
• W2062184115 hasConceptScore W2062184115C80444323 @default.
• W2062184115 hasConceptScore W2062184115C90119067 @default.
• W2062184115 hasLocation W20621841151 @default.
• W2062184115 hasOpenAccess W2062184115 @default.
• W2062184115 hasPrimaryLocation W20621841151 @default.
• W2062184115 hasRelatedWork W1492858093 @default.
• W2062184115 hasRelatedWork W1831618889 @default.
• W2062184115 hasRelatedWork W2178786736 @default.
• W2062184115 hasRelatedWork W2257399947 @default.
• W2062184115 hasRelatedWork W2277058918 @default.
• W2062184115 hasRelatedWork W2359478580 @default.
• W2062184115 hasRelatedWork W2366300241 @default.
• W2062184115 hasRelatedWork W2748369577 @default.
• W2062184115 hasRelatedWork W2899420932 @default.
• W2062184115 hasRelatedWork W4323060013 @default.
• W2062184115 isParatext "false" @default.
• W2062184115 isRetracted "false" @default.
• W2062184115 magId "2062184115" @default.
• W2062184115 workType "article" @default.