Abstract LR-parsing
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Doh, Kyung goo | - |
dc.contributor.author | Kim, Hyunha | - |
dc.contributor.author | Schmidt, David A. | - |
dc.date.accessioned | 2021-06-23T12:05:36Z | - |
dc.date.available | 2021-06-23T12:05:36Z | - |
dc.date.issued | 2011-11 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/39166 | - |
dc.description.abstract | We explain and illustrate abstract parsing, a static-analysis technique based on abstract interpretation, LR-parsing, and partial evaluation for validating PHP-like scripts that generate HTML/XML-style documents. A validated script is guaranteed to generate documents that are well formed with respect to the document language's LR(k)-grammar. In this way, abstract parsing resembles compiler data-type checking: a validated script will not go wrong and output a malformed, dynamically generated document. After presenting abstract parsing for LR(k)-grammars, we handle these important extensions: (i) String-replacement operations are analyzed by composing the finite-state automaton defined by a string replacement with the finite-state control of the LR(k)-parser. (ii) Conditional-test expressions are implemented by filter automata, which are also composed with the parser's finite-state control. (iii) Dynamically supplied and potentially malicious user input is predicted by characterizing it with an LR(k)-grammar and analyzing the strings generated by the grammar. (iv) Synthesized-attribute grammars are employed to calculate the semantics of the dynamically generated documents. © 2011 Springer-Verlag Berlin Heidelberg. | - |
dc.format.extent | 20 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Springer Verlag | - |
dc.title | Abstract LR-parsing | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1007/978-3-642-24933-4_6 | - |
dc.identifier.scopusid | 2-s2.0-84863081376 | - |
dc.identifier.wosid | 000392235800006 | - |
dc.identifier.bibliographicCitation | Formal Modeling: Actors; Open Systems, Biological Systems Essays Dedicated to Carolyn Talcott on the Occasion of Her 70th Birthday, v.7000 LNCS, pp 90 - 109 | - |
dc.citation.title | Formal Modeling: Actors; Open Systems, Biological Systems Essays Dedicated to Carolyn Talcott on the Occasion of Her 70th Birthday | - |
dc.citation.volume | 7000 LNCS | - |
dc.citation.startPage | 90 | - |
dc.citation.endPage | 109 | - |
dc.type.docType | Conference Paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Mathematical & Computational Biology | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Mathematical & Computational Biology | - |
dc.subject.keywordPlus | Abstract interpretations | - |
dc.subject.keywordPlus | Data type | - |
dc.subject.keywordPlus | Document languages | - |
dc.subject.keywordPlus | Finite state control | - |
dc.subject.keywordPlus | Finite-state automata | - |
dc.subject.keywordPlus | Partial evaluation | - |
dc.subject.keywordPlus | User input | - |
dc.subject.keywordPlus | Abstract interpretations | - |
dc.subject.keywordPlus | Analysis techniques | - |
dc.subject.keywordPlus | Attribute grammars | - |
dc.subject.keywordPlus | Document languages | - |
dc.subject.keywordPlus | Finite state control | - |
dc.subject.keywordPlus | Partial evaluation | - |
dc.subject.keywordPlus | Test expressions | - |
dc.subject.keywordPlus | User input | - |
dc.subject.keywordPlus | Abstracting | - |
dc.subject.keywordPlus | Automata theory | - |
dc.subject.keywordPlus | Biological systems | - |
dc.subject.keywordPlus | Semantics | - |
dc.subject.keywordPlus | Biological systems | - |
dc.subject.keywordPlus | Computational linguistics | - |
dc.subject.keywordPlus | Semantics | - |
dc.subject.keywordPlus | Formal languages | - |
dc.subject.keywordPlus | Abstract data types | - |
dc.subject.keywordAuthor | Data type | - |
dc.subject.keywordAuthor | Finite-state automata | - |
dc.subject.keywordAuthor | User input | - |
dc.subject.keywordAuthor | Formal languages | - |
dc.subject.keywordAuthor | Abstracting | - |
dc.subject.keywordAuthor | Semantics | - |
dc.subject.keywordAuthor | Automata theory | - |
dc.subject.keywordAuthor | Computational linguistics | - |
dc.subject.keywordAuthor | Analysis techniques | - |
dc.subject.keywordAuthor | Document languages | - |
dc.subject.keywordAuthor | Attribute grammars | - |
dc.subject.keywordAuthor | Abstract interpretations | - |
dc.subject.keywordAuthor | Test expressions | - |
dc.subject.keywordAuthor | Biological systems | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/978-3-642-24933-4_6 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.