E. Visser. A case study in optimizing parsing schemata by disambiguation lters. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient and Flexible Incremental Parsing - Wagner, Graham (1996) (1 citation) (Correct)
....often be implemented with no explicit storage costs whatsoever, and given the small size of the regions affected is very fast in practice. In order to implement this approach, regions of the parse tree described by ambiguous portions of the grammar must be re created whenever any modifi 19 Visser [1995] examines an alternative approach that instead modifies the item set construction to encode parse forest filters [Heering et al. 1992] To use this approach in conjunction with incremental parsing, the productions to which priority constraints apply must be indicated in a manner analogous to the ....
VISSER, E. 1995. A case study in optimizing parsing schemata by disambiguation filters. Tech.
A formal axiomatization for alphabet reasoning with.. - Korver, Sellink (1997) (9 citations) (Correct)
.... of Amsterdam Programming Research Group a b A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes Henri Korver Alex Sellink Report P9703 Februari 1997 University of Amsterdam Department of Computer Science Programming Research Group A formal axiomatization for alphabet reasoning with parametrized processes Henri Korver Alex Sellink Report P9703 Februari 1997 H.P. Korver ID Research Groningenweg 6 2803 PV Gouda The ....
.... Alphabet Reasoning with Parametrized Processes Henri Korver Alex Sellink Report P9703 Februari 1997 University of Amsterdam Department of Computer Science Programming Research Group A formal axiomatization for alphabet reasoning with parametrized processes Henri Korver Alex Sellink Report P9703 Februari 1997 H.P. Korver ID Research Groningenweg 6 2803 PV Gouda The Netherlands tel. 31 182 546546 e mail: H.Korver idr.nl M.P.A. Sellink Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. ....
[Article contains additional citation context not shown here]
E. Visser. A case study in optimizing parsing schemata by disambiguation filters.
A Generic Architecture for Data Flow Analysis to Support Reverse.. - Moonen (1997) (14 citations) (Correct)
....chaining for all variables (dotted arrows) The characters t and f denote the path that is taken when the condition of the while is respectively true or false. program fac begin declare input: natural, output: natural, repnr: natural, rep: natural; input : 3; output : 1; while (input 1 0) do rep : output; repnr : input; while (repnr 1 0) do output : output rep; repnr : repnr 1 od; input : input 1 od end program fac input : 3 output : 1 while (input 1 0) do t rep : output repnr : input while (repnr 1 0) do t output : output rep repnr : ....
.... t and f denote the path that is taken when the condition of the while is respectively true or false. program fac begin declare input: natural, output: natural, repnr: natural, rep: natural; input : 3; output : 1; while (input 1 0) do rep : output; repnr : input; while (repnr 1 0) do output : output rep; repnr : repnr 1 od; input : input 1 od end program fac input : 3 output : 1 while (input 1 0) do t rep : output repnr : input while (repnr 1 0) do t output : output rep repnr : repnr 1 input : input 1 end f f 4 A Generic ....
[Article contains additional citation context not shown here]
E. Visser. A case study in optimizing parsing schemata by disambiguation filters.
Reengineering COBOL software implies specification of the.. - van den Brand, al. (1997) (1 citation) (Correct)
....of Amsterdam Programming Research Group DATA DIVISION. WORKING STORAGE SECTION. 01. DSJDFRR IJ192390 SDJGEHJ2. 02. UI8T G5KM N034D PIC 99 99 99. 02. HJML97G KNBVFD45 7 HG PIC XXXXXX. 02. LK21 34 JSJKDJR 93894J PIC : 01. DVK54 FJKFJK4390 23 OKR2349IO PIC 9999. 01. HDRISO0934834R3NMJRQRRUJJJ49 PIC 9(2) Reengineering COBOL software implies specification of the underlying dialects Mark van den Brand Alex Sellink Chris Verhoef Report P9702 Februari University of Amsterdam Department of Computer Science ....
....of Amsterdam Programming Research Group DATA DIVISION. WORKING STORAGE SECTION. 01. DSJDFRR IJ192390 SDJGEHJ2. 02. UI8T G5KM N034D PIC 99 99 99. 02. HJML97G KNBVFD45 7 HG PIC XXXXXX. 02. LK21 34 JSJKDJR 93894J PIC : 01. DVK54 FJKFJK4390 23 OKR2349IO PIC 9999. 01. HDRISO0934834R3NMJRQRRUJJJ49 PIC 9(2) Reengineering COBOL software implies specification of the underlying dialects Mark van den Brand Alex Sellink Chris Verhoef Report P9702 Februari University of Amsterdam Department of Computer Science Programming Research Group Reengineering COBOL ....
[Article contains additional citation context not shown here]
E. Visser. A case study in optimizing parsing schemata by disambiguation filters.
Re-engineering needs Generic Programming Language Technology - van den Brand, Klint.. (1996) (5 citations) (Correct)
....Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7593 e mail: markvdb fwi.uva.nl P. Klint Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7585 e mail: paulk fwi.uva.nl CWI P.O.Box 94079 1090 GB Amsterdam The Netherlands tel. 31 20 592 4126 e mail: paulk cwi.nl C. Verhoef Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7581 e mail: x fwi.uva.nl Universiteit van Amsterdam, ....
.... van Amsterdam, Re engineering needs Generic Programming Language Technology Mark van den Brand 1 , Paul Klint 2;1 , Chris Verhoef 1 1 University of Amsterdam, Programming Research Group Kruislaan 403, NL 1098 SJ Amsterdam, The Netherlands 2 CWI, Department of Software Technology P.O. Box 94079, NL 1090 GB Amsterdam, The Netherlands markvdb wins.uva.nl, paulk cwi.nl, x wins.uva.nl Abstract Generic language technology and compiler construction techniques are a prerequisite to build analysis and conversion tools that are needed for the re engineering of large software systems. We ....
E. Visser. A case study in optimizing parsing schemata by disambiguation filters.
Generation of Components for Software Renovation.. - van den Brand.. (1997) (20 citations) (Correct)
.... of Amsterdam Programming Research Group Original Code Renovated Abstract Syntax Tree Transform Parse Unparse Code Generation of Components for Software Renovation Factories from Context free Grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June University of Amsterdam Department of Computer Science Programming Research Group Generation of components for software renovation factories from context free grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June M.G.J. van den Brand Programming Research Group ....
.... Grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June University of Amsterdam Department of Computer Science Programming Research Group Generation of components for software renovation factories from context free grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June M.G.J. van den Brand Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7593 e mail: markvdb fwi.uva.nl M.P.A. Sellink Programming Research Group Department of Computer Science University of ....
[Article contains additional citation context not shown here]
E. Visser. A case study in optimizing parsing schemata by disambiguation filters.
Parsing of Context-Free Languages - Sikkel, Nijholt (1997) (10 citations) (Correct)
....the parsing process. For the above mentioned grammar for arithmetic expressions. it is in fact possible to construct a deterministic LR type parser by disambiguating the states and transitions in the LR parsing table. A general formal framework for this type of optimization is given by Visser [KV94, Vis95] who applies disambiguation rules 13 at the level of parsing schemata. Head Driven parsing [Kay89] does not proceed through the sentence from left to right, but starts with the most informative parts. This introduces some extra administrative burden on the parser (as it jumps up and down the ....
Visser E. (1995): A Case Study in Optimizing Parsing Schemata by Disambiguation Filters. Report P9507, Dept. of Computer Science, University of Amsterdam, the Netherlands.
A Family of Syntax Definition Formalisms - Visser (1997) (9 citations) Self-citation (Visser) (Correct)
No context found.
E. Visser. A case study in optimizing parsing schemata by disambiguation filters.
From Context-Free Grammars With Priorities to Character Class.. - Visser (1997) (4 citations) Self-citation (Visser) (Correct)
No context found.
Visser, E. (1997a). A case study in optimizing parsing schemata by disambiguation filters. In International Workshop on Parsing Technology (IWPT'97), pages 210--224, Boston, USA. Massachusetts Institute of Technology.
Scannerless generalized-LR parsing - Visser (1997) (22 citations) Self-citation (Visser) (Correct)
No context found.
E. Visser. A case study in optimizing parsing schemata by disambiguation filters.
Polymorphic Syntax Definition - Visser (1997) (10 citations) Self-citation (Visser) (Correct)
No context found.
E. Visser. A case study in optimizing parsing schemata by disambiguation filters.
Basic Multi-Competence Programming - Bergstra, Bethke, Ponse (2000) (Correct)
No context found.
E. Visser. A case study in optimizing parsing schemata by disambiguation lters.
An Arithmetical Module for Rationals and Reals - Bergstra, Sellink (1997) (6 citations) (Correct)
No context found.
E. Visser. A case study in optimizing parsing schemata by disambiguation filters.
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