No abstract available.
Cited By
- Wang S, Zhang M, Li G, Liu C, Wang Z, Liu Y and Xu M (2023). Bolt: Scalable and Cost-Efficient Multistring Pattern Matching With Programmable Switches, IEEE/ACM Transactions on Networking, 31:2, (846-861), Online publication date: 1-Apr-2023.
- Kalita P, Singal D, Agarwal P, Jhunjhunwala S and Roy S (2022). Symbolic encoding of LL(1) parsing and its applications, Formal Methods in System Design, 61:2-3, (338-379), Online publication date: 1-Dec-2022.
- Tracy K (2021). Software, 10.1145/3477339, Online publication date: 6-Sep-2021.
- Pshenitsyn T Hypergraph Basic Categorial Grammars Graph Transformation, (146-162)
- Zúñiga A, Sierra G, Bel-Enguix G and Galicia-Haro S Towards a Natural Language Compiler Advances in Computational Intelligence, (70-82)
- Aizikowitz T and Kaminski M (2016). LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata, Journal of Computer and System Sciences, 82:8, (1329-1359), Online publication date: 1-Dec-2016.
- Kutrib M and Malcher A (2013). One-Dimensional Cellular Automaton Transducers, Fundamenta Informaticae, 126:2-3, (201-224), Online publication date: 1-Apr-2013.
- Kutrib M and Malcher A (2012). Reversible pushdown automata, Journal of Computer and System Sciences, 78:6, (1814-1827), Online publication date: 1-Nov-2012.
- Hayashi K, Watanabe T, Asahara M and Matsumoto Y Head-driven transition-based parsing with top-down prediction Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1, (657-665)
- Brailsford D (2012). Reconstituting typeset Marriage Registers using simple software tools, Computer Science - Research and Development, 27:2, (113-126), Online publication date: 1-May-2012.
- Nederhof M and Satta G Computation of infix probabilities for probabilistic context-free grammars Proceedings of the Conference on Empirical Methods in Natural Language Processing, (1213-1221)
- Morell L and Middleton D (2010). Using information flow to analyze grammars, Journal of Computing Sciences in Colleges, 25:5, (21-26), Online publication date: 1-May-2010.
- Redziejowski R (2008). Some Aspects of Parsing Expression Grammar, Fundamenta Informaticae, 85:1-4, (441-451), Online publication date: 20-Sep-2008.
- Han Y and Wood D (2008). Generalizations of 1-deterministic regular languages, Information and Computation, 206:9-10, (1117-1125), Online publication date: 1-Sep-2008.
- Redziejowski R (2007). Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking, Fundamenta Informaticae, 79:3-4, (513-524), Online publication date: 1-Feb-2008.
- Frost R, Hafiz R and Callaghan P Parser combinators for ambiguous left-recursive grammars Proceedings of the 10th international conference on Practical aspects of declarative languages, (167-181)
- Redziejowski R (2008). Some Aspects of Parsing Expression Grammar, Fundamenta Informaticae, 85:1-4, (441-451), Online publication date: 1-Jan-2008.
- Redziejowski R (2007). Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking, Fundamenta Informaticae, 79:3-4, (513-524), Online publication date: 1-Aug-2007.
- Steinby M and Tîrnăucă C Syntax-directed translations and quasi-alphabetic tree bimorphisms Proceedings of the 12th international conference on Implementation and application of automata, (265-276)
- Brabrand C, Giegerich R and Møller A Analyzing ambiguity of context-free grammars Proceedings of the 12th international conference on Implementation and application of automata, (214-225)
- Miller T, Exley A and Schuler W Elements of a spoken language programming interface for robots Proceedings of the ACM/IEEE international conference on Human-robot interaction, (231-237)
- Floyd R The paradigms of programming ACM Turing award lectures
- Dubey A (2006). Goodness criteria for programming language grammar rules, ACM SIGPLAN Notices, 41:12, (44-53), Online publication date: 1-Dec-2006.
- Gálvez J, Schmitz S and Farré J Shift-Resolve parsing Proceedings of the 11th international conference on Implementation and Application of Automata, (253-264)
- Scott E and Johnstone A (2006). Right nulled GLR parsers, ACM Transactions on Programming Languages and Systems, 28:4, (577-618), Online publication date: 1-Jul-2006.
- Schmitz S Noncanonical LALR(1) parsing Proceedings of the 10th international conference on Developments in Language Theory, (95-107)
- Huang L, Knight K and Joshi A A syntax-directed translator with extended domain of locality Proceedings of the Workshop on Computationally Hard Problems and Joint Inference in Speech and Language Processing, (1-8)
- Wong Y and Mooney R Learning for semantic parsing with statistical machine translation Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, (439-446)
- Zhang H, Huang L, Gildea D and Knight K Synchronous binarization for machine translation Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, (256-263)
- Naumann U and Vehreschild A Tangent-Linear models by augmented LL-Parsers Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I, (865-874)
- Yoshimoto K, Kobayashi M, Nakamura H and Mori Y Processing of information structure and floating quantifiers in japanese Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence, (103-110)
- Wich K (2005). Sublogarithmic ambiguity, Theoretical Computer Science, 345:2-3, (473-504), Online publication date: 22-Nov-2005.
- Goldstine J, Leung H and Wotschke D (2005). Measuring nondeterminism in pushdown automata, Journal of Computer and System Sciences, 71:4, (440-466), Online publication date: 1-Nov-2005.
- Satta G and Peserico E Some computational complexity results for synchronous context-free grammars Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, (803-810)
- Sakakibara Y (2005). Learning context-free grammars using tabular representations, Pattern Recognition, 38:9, (1372-1383), Online publication date: 1-Sep-2005.
- Watters S, Miller T, Balachandran P, Schuler W and Voyles R Exploiting a sensed environment to improve human-agent communication Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, (44-50)
- Klint P, Lämmel R and Verhoef C (2005). Toward an engineering discipline for grammarware, ACM Transactions on Software Engineering and Methodology, 14:3, (331-380), Online publication date: 1-Jul-2005.
- Sakakibara Y (2005). Grammatical Inference in Bioinformatics, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27:7, (1051-1062), Online publication date: 1-Jul-2005.
- Reussner R, Happe J and Habel A Modelling parametric contracts and the state space of composite components by graph grammars Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering, (80-95)
- Saitou T, Suzuki M and Watanabe T (2005). Dominance analysis of irreducible CFGs by reduction, ACM SIGPLAN Notices, 40:4, (10-19), Online publication date: 1-Apr-2005.
- Teslenko M and Dubrova E An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs Proceedings of the conference on Design, Automation and Test in Europe - Volume 1, (406-411)
- Dubrova E Structural Testing Based on Minimum Kernels Proceedings of the conference on Design, Automation and Test in Europe - Volume 2, (1168-1173)
- Krenz R and Dubrova E Improved Boolean function hashing based on multiple-vertex dominators Proceedings of the 2005 Asia and South Pacific Design Automation Conference, (573-578)
- Krenz R and Dubrova E A fast algorithm for finding common multiple-vertex dominators in circuit graphs Proceedings of the 2005 Asia and South Pacific Design Automation Conference, (529-532)
- Smrž P and Kadlec V Incremental parser for Czech Proceedings of the 4th international symposium on Information and communication technologies, (117-122)
- Chidlovskii B and Fuselier J Supervised learning for the legacy document conversion Proceedings of the 2004 ACM symposium on Document engineering, (220-228)
- Nederhof M and Satta G Probabilistic parsing strategies Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, (542-es)
- Kanthak S and Ney H FSA Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, (510-es)
- Spiesser J and Kitchen L Optimization of html automatically generated by wysiwyg programs Proceedings of the 13th international conference on World Wide Web, (355-364)
- Pennello T and DeRemer F (2004). Efficient computation of LALR(1) look-ahead sets, ACM SIGPLAN Notices, 39:4, (14-27), Online publication date: 1-Apr-2004.
- Farré J and Gálvez J (2004). Bounded-connect noncanonical discriminating-reverse parsers, Theoretical Computer Science, 313:1, (73-91), Online publication date: 16-Feb-2004.
- Ford B Parsing expression grammars Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (111-122)
- Prolo C An efficient LR parser generator for tree-adjoining grammars New developments in parsing technology, (125-155)
- Bunt H, Carroll J and Satta G Development in parsing technology New developments in parsing technology, (1-18)
- Ford B (2004). Parsing expression grammars, ACM SIGPLAN Notices, 39:1, (111-122), Online publication date: 1-Jan-2004.
- Hanneforth T, Heintze S and Stede M Rhetorical parsing with underspecification and forests Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology: companion volume of the Proceedings of HLT-NAACL 2003--short papers - Volume 2, (31-33)
- Pretorius L and Bosch S (2003). Enabling computer interaction in the indigenous languages of South Africa, Interactions, 10:2, (56-63), Online publication date: 1-Mar-2003.
- Král J and Žemlička M Software confederations Managing globally with information technology, (57-81)
- Kuikka E, Leinonen P and Penttonen M Towards automating of document structure transformations Proceedings of the 2002 ACM symposium on Document engineering, (103-110)
- Ford B Packrat parsing: Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, (36-47)
- Ford B (2002). Packrat parsing:, ACM SIGPLAN Notices, 37:9, (36-47), Online publication date: 17-Sep-2002.
- Chen H and Dong Y (2002). Yet another meta-language for programming language processing, ACM SIGPLAN Notices, 37:6, (28-37), Online publication date: 2-Jun-2002.
- St-Denis R (2002). Designing reactive systems, Journal of Systems and Software, 60:2, (103-112), Online publication date: 1-Feb-2002.
- (2001). On parsing LL-languages, Theoretical Computer Science, 267:1-2, (49-59), Online publication date: 26-Sep-2001.
- Albert J, Giammarresi D and Wood D (2001). Normal form algorithms for extended context-free grammars, Theoretical Computer Science, 267:1-2, (35-47), Online publication date: 26-Sep-2001.
- Garcia A and Haeusler E (2001). Code migration and program maintainability---a categorical perspective, Information Processing Letters, 79:5, (249-254), Online publication date: 1-Sep-2001.
- Nederhof M Approximating context-free by rational transduction for example-based MT Proceedings of the workshop on Data-driven methods in machine translation - Volume 14, (1-8)
- Aycock J (2001). Why bison is becoming extinct, XRDS: Crossroads, The ACM Magazine for Students, 7:5, (3-3), Online publication date: 5-Jul-2001.
- Zima E On computational properties of chains of recurrences Proceedings of the 2001 international symposium on Symbolic and algebraic computation
- Kim J, Kim J and Hwang D Korean text summarization using an aggregate similarity Proceedings of the fifth international workshop on on Information retrieval with Asian languages, (111-118)
- Ivanov Y and Bobick A (2000). Recognition of Visual Activities and Interactions by Stochastic Parsing, IEEE Transactions on Pattern Analysis and Machine Intelligence, 22:8, (852-872), Online publication date: 1-Aug-2000.
- Johnson M and Roark B Compact non-left-recursive grammars using the selective left-corner transform and factoring Proceedings of the 18th conference on Computational linguistics - Volume 1, (355-361)
- Alshawi H, Douglas S and Bangalore S (2000). Learning dependency translation models as collections of finite-state head transducers, Computational Linguistics, 26:1, (45-60), Online publication date: 1-Mar-2000.
- Ritchie G (1999). Completeness conditions for mixed strategy bidirectional parsing, Computational Linguistics, 25:4, (457-486), Online publication date: 1-Dec-1999.
- Lopes A (1999). Ada+SQL—an overview, ACM SIGAda Ada Letters, XIX:3, (157-162), Online publication date: 1-Sep-1999.
- Lopes A Ada+SQL—an overview Proceedings of the 1999 annual ACM SIGAda international conference on Ada, (157-162)
- Abney S, McAllester D and Pereira F Relating probabilistic grammars and automata Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, (542-549)
- Eisner J and Satta G Efficient parsing for bilexical context-free grammars and head automaton grammars Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, (457-464)
- Haiming C (1998). Combining CFG and recursive functions to get a new language, ACM SIGPLAN Notices, 34:1, (351), Online publication date: 1-Jan-1999.
- Buchsbaum A, Kaplan H, Rogers A and Westbrook J (1998). A new, simpler linear-time dominators algorithm, ACM Transactions on Programming Languages and Systems, 20:6, (1265-1296), Online publication date: 1-Nov-1998.
- Haiming C Combining CFG and recursive functions to get a new language Proceedings of the third ACM SIGPLAN international conference on Functional programming
- Fanton M Finite state automata and Arabic writing Proceedings of the Workshop on Computational Approaches to Semitic Languages, (26-33)
- Johnson M Finite-state approximation of constraint-based grammars using left-corner grammar transforms Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 1, (619-623)
- Wu D and Hkust H Machine translation with a stochastic grammatical channel Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 2, (1408-1415)
- Buchsbaum A, Kaplan H, Rogers A and Westbrook J Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators Proceedings of the thirtieth annual ACM symposium on Theory of computing, (279-288)
- Snoeck M and Dedene G (1998). Existence Dependency, IEEE Transactions on Software Engineering, 24:4, (233-251), Online publication date: 1-Apr-1998.
- Karg C LR(k) Testing is Average Case Complete Proceedings of the 12th Annual IEEE Conference on Computational Complexity
- Cyre W (1997). Capture, Integration, and Analysis of Digital System Requirements with Conceptual Graphs, IEEE Transactions on Knowledge and Data Engineering, 9:1, (8-23), Online publication date: 1-Jan-1997.
- Rambow O and Satta G Synchronous models of language Proceedings of the 34th annual meeting on Association for Computational Linguistics, (116-123)
- Stolcke A (1995). An efficient probabilistic context-free parsing algorithm that computes prefix probabilities, Computational Linguistics, 21:2, (165-201), Online publication date: 1-Jun-1995.
- Ehrenfeucht A, Engelfriet J, Pas P and Rozenberg G (1995). Grammatical Codes Of Trees And Terminally Coded Grammars, Fundamenta Informaticae, 23:1, (1-32), Online publication date: 1-Jan-1995.
- Hemphill C and Thrift P Surfing the Web by voice Proceedings of the third ACM international conference on Multimedia, (215-222)
- Sharman R Syllable-based phonetic transcription by maximum likelihood methods Proceedings of the 15th conference on Computational linguistics - Volume 2, (1279-1283)
- Kolarik T (1993). Extending the two-partner shared variable protocol to n partners, ACM SIGAPL APL Quote Quad, 24:1, (124-133), Online publication date: 1-Sep-1993.
- Kolarik T Extending the two-partner shared variable protocol to n partners Proceedings of the international conference on APL, (124-133)
- Aasa A Precedences for conctypes Proceedings of the conference on Functional programming languages and computer architecture, (83-91)
- Fred A and Leitão J An heuristic-based context-free parsing algorithm Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: speech processing - Volume II, (67-70)
- Matzen R, George K and Hedrick G A model for studying ambiguity in SGML element declarations Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (665-676)
- Wehrli E The IPS system Proceedings of the 14th conference on Computational linguistics - Volume 3, (870-874)
- Milward D Dynamics, dependency grammar and incremental interpretation Proceedings of the 14th conference on Computational linguistics - Volume 4, (1095-1099)
- Wehrli E The IPS system Proceedings of the 14th conference on Computational linguistics - Volume 3, (870-874)
- Dymetman M A generalized Greibach Normal Form for definite clause grammars Proceedings of the 14th conference on Computational linguistics - Volume 1, (366-372)
- Geyer-Schulz A and Kolarik T (1992). Distributed computing with APL, ACM SIGAPL APL Quote Quad, 23:1, (60-69), Online publication date: 15-Jul-1992.
- Geyer-Schulz A and Kolarik T Distributed computing with APL Proceedings of the international conference on APL, (60-69)
- Corazza A, De Mori R and Satta G Computation of upper-bounds for stochastic context-free languages Proceedings of the tenth national conference on Artificial intelligence, (344-349)
- Merlo P An LR category-neutral parser with left corner prediction Proceedings of the 30th annual meeting on Association for Computational Linguistics, (288-290)
- Satta G Recognition of linear context-free rewriting systems Proceedings of the 30th annual meeting on Association for Computational Linguistics, (89-95)
- Steegmans E, Lewi J and Van Horebeek I (1992). Generation of Interactive Parsers with Error Handling, IEEE Transactions on Software Engineering, 18:5, (357-367), Online publication date: 1-May-1992.
- McDonald D An efficient chart-based algorithm for partial-parsing of unrestricted texts Proceedings of the third conference on Applied natural language processing, (193-200)
- Bates J and Lavie A Recognizing substrings of LR(k) languages in linear time Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (235-245)
- Proctor L (1991). Review of "Computer processing of natural language" by Gilbert K. Krulee. Prentice Hall 1991, Computational Linguistics, 17:4, (442-447), Online publication date: 1-Dec-1991.
- Lee L, Lin L, Chen K, Chien L and Huang J (1991). An efficient natural language processing system specially designed for the Chinese language, Computational Linguistics, 17:4, (347-374), Online publication date: 1-Dec-1991.
- Tague J, Salminen A and McClellan C Complete formal model for information retrieval systems Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval, (14-20)
- Nakano M Constraint projection Proceedings of the 29th annual meeting on Association for Computational Linguistics, (307-314)
- Ibarra O, Pong T and Sohn S (1991). Parallel Recognition and Parsing on the Hypercube, IEEE Transactions on Computers, 40:6, (764-770), Online publication date: 1-Jun-1991.
- Rimon M and Herz J The recognition capacity of local syntactic constraints Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics, (155-160)
- Leermakers R Non-deterministic recursive ascent parsing Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics, (63-68)
- Dahl V and Popowich F (1990). Parsing and generation with Static Discontinuity Grammars, New Generation Computing, 8:3, (245-274), Online publication date: 1-Oct-1990.
- Numazaki H and Tanaka H A new parallel algorithm for generalized LR parsing Proceedings of the 13th conference on Computational linguistics - Volume 2, (305-310)
- König E The complexity of parsing with extended categorial grammars Proceedings of the 13th conference on Computational linguistics - Volume 2, (233-238)
- Blache P and Morin J Bottom-Up Filtering Proceedings of the 13th conference on Computational linguistics - Volume 2, (19-23)
- Russi T A syntactic and morphological analyzer for a text-to-speech system Proceedings of the 13th conference on Computational linguistics - Volume 3, (443-445)
- Hasida K A constraint-based approach to linguistic performance Proceedings of the 13th conference on Computational linguistics - Volume 3, (149-154)
- Marino M Bottom-up parsing extending context-freeness in a Process Grammar processor Proceedings of the 28th annual meeting on Association for Computational Linguistics, (299-306)
- Rim H, Seo J and Simmons R Transforming syntactic graphs into semantic graphs Proceedings of the 28th annual meeting on Association for Computational Linguistics, (47-53)
- Billot S and Lang B The structure of shared forests in ambiguous parsing Proceedings of the 27th annual meeting on Association for Computational Linguistics, (143-151)
- Leermakers R How to cover a grammar Proceedings of the 27th annual meeting on Association for Computational Linguistics, (135-142)
- Tuda H, Hasida K and Sirai H JPSG parser on constraint logic programming Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics, (95-102)
- Calder J Paradigmatic morphology Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics, (58-65)
- Seo J and Simmons R (1989). Syntactic graphs, Computational Linguistics, 15:1, (19-32), Online publication date: 1-Mar-1989.
- Stock O (1989). Parsing with flexibility, dynamic strategies, and idioms in mind, Computational Linguistics, 15:1, (1-18), Online publication date: 1-Mar-1989.
- Krämer B and Schmidt H (1989). Developing Integrated Environments with ASDL, IEEE Software, 6:1, (98-107), Online publication date: 1-Jan-1989.
- Nogami H, Yoshimura Y and Amano S Parsing with look-ahead in real-time on-line translation system Proceedings of the 12th conference on Computational linguistics - Volume 2, (488-493)
- Marino M A process-activation based parsing algorithm for the development of Natural Language Grammars Proceedings of the 12th conference on Computational linguistics - Volume 1, (390-395)
- Lang B Parsing incomplete sentences Proceedings of the 12th conference on Computational linguistics - Volume 1, (365-371)
- Kilbury J Parsing with Category Coocurrence Restrictions Proceedings of the 12th conference on Computational linguistics - Volume 1, (324-327)
- Yau S and Hong W (1988). Verification of Concurrent Control Flow in Distributed Computer Systems, IEEE Transactions on Software Engineering, 14:4, (405-417), Online publication date: 1-Apr-1988.
- Grishman R and Chitrao M Evaluation of a parallel chart parser Proceedings of the second conference on Applied natural language processing, (71-76)
- Krämer B and Schmidt H Object-oriented development of integrated programming environments with ASDL Proceedings of the 1988 ACM SIGSMALL/PC symposium on ACTES, (11-21)
- Correa N An attribute-grammar implementation of Government-binding theory Proceedings of the 25th annual meeting on Association for Computational Linguistics, (45-51)
- Gibbon D Finite state processing of tone systems Proceedings of the third conference on European chapter of the Association for Computational Linguistics, (291-297)
- Wirén M A comparison of rule-invocation strategies in context-free chart parsing Proceedings of the third conference on European chapter of the Association for Computational Linguistics, (226-233)
- Briscoe T Deterministic parsing and unbounded dependencies Proceedings of the third conference on European chapter of the Association for Computational Linguistics, (211-217)
- Thompson J and Sanati-Mehrizy R Formalization of operations and function definitions in a functional programming language for data structures Proceedings of the 15th annual conference on Computer Science, (210-219)
- Tomita M (1987). An efficient augmented-context-free parsing algorithm, Computational Linguistics, 13:1-2, (31-46), Online publication date: 1-Jan-1987.
- Chang J, Ibarra O and Palis M (1987). Parallel parsing on a one-way array of finite-state machines, IEEE Transactions on Computers, 36:1, (64-75), Online publication date: 1-Jan-1987.
- Tomita M and Carbonell J Another stride towards knowledge-based machine translation Proceedings of the 11th coference on Computational linguistics, (633-638)
- Haugeneder H and Gehrke M A user friendly ATN Programming Environment (APE) Proceedings of the 11th coference on Computational linguistics, (399-404)
- Humenik K and Pinkham R Production probability estimators for context-free grammars Proceedings of the 1986 ACM fourteenth annual conference on Computer science, (173-181)
- Harel D A linear algorithm for finding dominators in flow graphs and related problems Proceedings of the seventeenth annual ACM symposium on Theory of computing, (185-194)
- Gazdar G and Pullum G (1985). Computationally relevant properties of natural languages and their grammars, New Generation Computing, 3:3, (273-306), Online publication date: 1-Sep-1985.
- Srisuresh P and Eager M A portable syntactic error recovery scheme for LR(1) parsers Proceedings of the 1985 ACM thirteenth annual conference on Computer Science, (390-399)
- Tomita M LR parsers for natural languages Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics, (354-357)
- Berwick R Bounded context parsing and easy learnability Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics, (20-23)
- Jourdan M Strongly non-circular attribute grammars and their recursive evaluation Proceedings of the 1984 SIGPLAN symposium on Compiler construction, (81-93)
- Bunda J and Gerth J APL two by two-syntax analysis by pairwise reduction Proceedings of the international conference on APL, (85-94)
- Bose P and Davidson E (1984). Design of instruction set architectures for support of high-level languages, ACM SIGARCH Computer Architecture News, 12:3, (198-206), Online publication date: 1-Jun-1984.
- Jourdan M (1984). Strongly non-circular attribute grammars and their recursive evaluation, ACM SIGPLAN Notices, 19:6, (81-93), Online publication date: 1-Jun-1984.
- Bunda J and Gerth J (1984). APL two by two-syntax analysis by pairwise reduction, ACM SIGAPL APL Quote Quad, 14:4, (85-94), Online publication date: 1-Jun-1984.
- Campbell R and Kirslis P (1984). The SAGA project, ACM SIGPLAN Notices, 19:5, (73-80), Online publication date: 1-May-1984.
- Campbell R and Kirslis P (1984). The SAGA project, ACM SIGSOFT Software Engineering Notes, 9:3, (73-80), Online publication date: 1-May-1984.
- Campbell R and Kirslis P The SAGA project Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments, (73-80)
- Forman I An algebra for data flow anomaly detection Proceedings of the 7th international conference on Software engineering, (278-286)
- Murtagh T A less dynamic memory allocation scheme for algol-like languages Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (283-289)
- Hoffmann C and O`Donnell M Implementation of an interpreter for abstract equations Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (111-121)
- Bose P and Davidson E Design of instruction set architectures for support of high-level languages Proceedings of the 11th annual international symposium on Computer architecture, (198-206)
- Bongulielmi A and Cellier F (1984). On the usefulness of deterministic grammars for simulation languages, ACM SIGSIM Simulation Digest, 15:1, (14-36), Online publication date: 1-Jan-1984.
- Prodanof I and Ferrari G Extended access to the left context in an ATN parser Proceedings of the first conference on European chapter of the Association for Computational Linguistics, (58-65)
- Cooke D (1983). On non-hierachical systems of binary operators, ACM SIGACT News, 15:3, (36-44), Online publication date: 1-Jul-1983.
- Requa J (1983). The Piecewise Data Flow architecture control flow and register management, ACM SIGARCH Computer Architecture News, 11:3, (84-89), Online publication date: 30-Jun-1983.
- King R (1983). Research on synthesis of concurrent computing systems (Extended Abstract), ACM SIGARCH Computer Architecture News, 11:3, (39-46), Online publication date: 30-Jun-1983.
- Pereira F and Warren D Parsing as deduction Proceedings of the 21st annual meeting on Association for Computational Linguistics, (137-144)
- Berwick R and Weinberg A Syntactic constraints and efficient parsability Proceedings of the 21st annual meeting on Association for Computational Linguistics, (119-122)
- Perrault C On the mathematical properties of linguistic theories Proceedings of the 21st annual meeting on Association for Computational Linguistics, (98-105)
- Requa J The Piecewise Data Flow architecture control flow and register management Proceedings of the 10th annual international symposium on Computer architecture, (84-89)
- King R Research on synthesis of concurrent computing systems (Extended Abstract) Proceedings of the 10th annual international symposium on Computer architecture, (39-46)
- Bossi A, Cocco N and Dulli S (1983). Modular decomposition of Ada into a hierarchy of sublanguages, ACM SIGAda Ada Letters, II:6, (53-58), Online publication date: 1-May-1983.
- Rich E (1983). Artificial intelligence, 10.5555/30423, Online publication date: 1-Jan-1983.
- Forman I Global data flow analysis by decomposition into primes Proceedings of the 6th international conference on Software engineering, (386-392)
- Plátek M Composition of translation schemes with D-trees Proceedings of the 9th conference on Computational linguistics - Volume 1, (313-318)
- Ukkonen E (1982). Structure preserving elimination of null productions from context-free grammars, Theoretical Computer Science, 17:1, (43-54), Online publication date: 1-Jun-1982.
- Bose P, Rau B and Schlansker M Systematically derived instruction sets for high-level language support Proceedings of the 20th annual ACM Southeast Regional Conference, (73-84)
- Leinwand S Logical correctness by construction Proceedings of the 19th Design Automation Conference, (825-831)
- Mueller R and Johnson G Contrasting translation, verification and synthesis in software and firmware engineering Proceedings of the 14th annual workshop on Microprogramming, (17-22)
- Mueller R and Johnson G (1981). Contrasting translation, verification and synthesis in software and firmware engineering, ACM SIGMICRO Newsletter, 12:4, (17-22), Online publication date: 1-Dec-1981.
- Keller R and Lindstrom G Applications of feedback in functional programming Proceedings of the 1981 conference on Functional programming languages and computer architecture, (123-130)
- Slocum J A practical comparison of parsing strategies Proceedings of the 19th annual meeting on Association for Computational Linguistics, (1-6)
- Morris J and Schwartz M The design of a language-directed editor for block-structured languages Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation, (28-33)
- Morris J and Schwartz M (1981). The design of a language-directed editor for block-structured languages, ACM SIGPLAN Notices, 16:6, (28-33), Online publication date: 1-Jun-1981.
- Ukkonen E and Soisalon-Soininen E LALR(k) testing is PSPACE-complete Proceedings of the thirteenth annual ACM symposium on Theory of computing, (202-206)
- Morris J and Schwartz M (1981). The design of a language-directed editor for block-structured languages, ACM SIGOA Newsletter, 2:1-2, (28-33), Online publication date: 1-Apr-1981.
- Myers E and Osterweil L BIGMAC II Proceedings of the 5th international conference on Software engineering, (410-421)
- Hitaka T and Yoshida S A syntax parser based on the case dependency grammar and its efficiency Proceedings of the 8th conference on Computational linguistics, (15-20)
- Leiss E (1980). Constructing a finite automaton for a given regular expression, ACM SIGACT News, 12:3, (81-87), Online publication date: 1-Sep-1980.
- Chroust G and Mühlbacher J (1980). Rivalling multiprocessor organization, ACM SIGARCH Computer Architecture News, 8:5, (7-10), Online publication date: 15-Aug-1980.
- Graham S, Harrison M and Ruzzo W (1980). An Improved Context-Free Recognizer, ACM Transactions on Programming Languages and Systems, 2:3, (415-462), Online publication date: 1-Jul-1980.
- Chester D (1980). A parsing algorithm that extends phrases, Computational Linguistics, 6:2, (87-96), Online publication date: 1-Apr-1980.
- Hunt H and Rosenkrantz D Efficient algorithms for structural similarity of grammars Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (213-219)
- Filipski G, Moore D and Newton J Ada as a software transition tool Proceedings of the ACM-SIGPLAN symposium on The ADA programming language, (176-182)
- Mattheyses R and Conry S (1979). Models for specification and anaysis of parallel computing systems, ACM SIGSIM Simulation Digest, 11:1, (215-224), Online publication date: 1-Sep-1979.
- Mattheyses R and Conry S (1979). Models for specification and anaysis of parallel computing systems, ACM SIGMETRICS Performance Evaluation Review, 8:3, (215-224), Online publication date: 1-Sep-1979.
- Mattheyses R and Conry S Models for specification and anaysis of parallel computing systems Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems, (215-224)
- DeRemer F and Pennello T Efficient computation of LALR(1) look-ahead sets Proceedings of the 1979 SIGPLAN symposium on Compiler construction, (176-187)
- Pai A and Kieburtz R Global context recovery Proceedings of the 1979 SIGPLAN symposium on Compiler construction, (158-167)
- Pleban U The use of transition matrices in a recursive-descent compiler Proceedings of the 1979 SIGPLAN symposium on Compiler construction, (144-151)
- DeRemer F and Pennello T (1979). Efficient computation of LALR(1) look-ahead sets, ACM SIGPLAN Notices, 14:8, (176-187), Online publication date: 1-Aug-1979.
- Pai A and Kieburtz R (1979). Global context recovery, ACM SIGPLAN Notices, 14:8, (158-167), Online publication date: 1-Aug-1979.
- Pleban U (1979). The use of transition matrices in a recursive-descent compiler, ACM SIGPLAN Notices, 14:8, (144-151), Online publication date: 1-Aug-1979.
- Floyd R (1979). The paradigms of programming, Communications of the ACM, 22:8, (455-460), Online publication date: 1-Aug-1979.
- Ukkonen E (1979). The nonexistence of some covering context-free grammars, Information Processing Letters, 8:4, (187-192), Online publication date: 1-Apr-1979.
- LaLonde W (1979). A finite state approach to operator classification, ACM SIGPLAN Notices, 14:1, (46-54), Online publication date: 1-Jan-1979.
- Pozefsky D and Jazayeri M A Family Of Pass-Oriented Attribute Grammar Evaluators Proceedings of the 1978 annual conference, (261-270)
- Mickunas M and Schell R Parallel Compilation In A Multiprocessor Environment (Extended Abstract) Proceedings of the 1978 annual conference, (241-246)
- Pour-El M Computer Science And Recursion Theory Proceedings of the 1978 annual conference, (15-20)
- Ripley G (1978). A simple recovery-only procedure for simple precedence parsers, Communications of the ACM, 21:11, (928-930), Online publication date: 1-Nov-1978.
- Haspel C (1978). The portable computer in the classroom, ACM SIGCUE Outlook, 12:3, (4-12), Online publication date: 1-Jul-1978.
- Postma S (1978). FEA, ACM SIGPLAN Notices, 13:7, (43-59), Online publication date: 1-Jul-1978.
- Mickunas M and Modry J (1978). Automatic error recovery for LR parsers, Communications of the ACM, 21:6, (459-465), Online publication date: 1-Jun-1978.
- Linn J Techniques for the construction of small and fast lexical analyzers Proceedings of the 16th annual Southeast regional conference, (265-268)
- Workman D and Higdon J The design of a parser generator Proceedings of the 16th annual Southeast regional conference, (82-86)
- Luckham D A brief account Proceedings of the 1978 annual conference - Volume 2, (786-792)
- Pennello T and DeRemer F A forward move algorithm for LR error recovery Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (241-254)
- Bonczek R, Cash J and Whinston A (1977). A transformational grammar-based query processor for access control in a planning system, ACM Transactions on Database Systems, 2:4, (326-338), Online publication date: 1-Dec-1977.
- Shin-Yee Lu and King-Sun Fu (1977). Stochastic Error-Correcting Syntax Analysis for Recognition of Noisy Patterns, IEEE Transactions on Computers, 26:12, (1268-1276), Online publication date: 1-Dec-1977.
- LaLonde W (1977). Regular right part grammars and their parsers, Communications of the ACM, 20:10, (731-741), Online publication date: 1-Oct-1977.
- Sudborough I Separating tape bounded auxiliary pushdown automata classes Proceedings of the ninth annual ACM symposium on Theory of computing, (208-217)
- Bertsch E (1977). The storage requirement in precedence parsing, Communications of the ACM, 20:3, (192-194), Online publication date: 1-Mar-1977.
- Haynes W, Hughes C and Pfleeger C ORACLE a tool for learning compiler writing Proceedings of the seventh SIGCSE technical symposium on Computer science education, (37-52)
- Haynes W, Hughes C and Pfleeger C (1977). ORACLE a tool for learning compiler writing, ACM SIGCSE Bulletin, 9:1, (37-52), Online publication date: 1-Feb-1977.
- Soisalon-Soininen E Elimination of single productions from LR parsers in conjunction with the use of default reductions Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (183-193)
- Demers A Generalized left corner parsing Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (170-182)
- Fischer C, Milton D and Quiring S An efficient insertion-only error-corrector for LL(1) parsers Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (97-103)
- Nijholt A On the covering of left recursive grammars Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (86-96)
- Jarvis J (1976). The line drawing editor, an experiment in computer vision, ACM SIGGRAPH Computer Graphics, 10:2, (288-292), Online publication date: 1-Aug-1976.
- Jarvis J The line drawing editor, an experiment in computer vision Proceedings of the 3rd annual conference on Computer graphics and interactive techniques, (288-292)
- Sudborough I On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store Proceedings of the eighth annual ACM symposium on Theory of computing, (141-148)
- Hunt H and Szymanski T Dichotomization, reachability, and the forbidden subgraph problem(Extended Abstract) Proceedings of the eighth annual ACM symposium on Theory of computing, (126-134)
- Graham S, Harrison M and Ruzzo W On line context free language recognition in less than cubic time(Extended Abstract) Proceedings of the eighth annual ACM symposium on Theory of computing, (112-120)
- Oliver S and Jones N (1976). Program control via transition matrices—a novel application of micro-programming, ACM SIGPLAN Notices, 11:4, (70-77), Online publication date: 1-Apr-1976.
- Oliver S and Jones N Program control via transition matrices—a novel application of micro-programming Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment, (70-77)
- Oliver A and Jones N (1976). Program control via transition matrices, ACM SIGMICRO Newsletter, 7:1, (8-27), Online publication date: 1-Mar-1976.
- Leong B and Wotschke D The influence of productions on derivations and parsing (Extended Abstract) Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, (1-11)
- Graham S and Wegman M (1976). A Fast and Usually Linear Algorithm for Global Flow Analysis, Journal of the ACM, 23:1, (172-202), Online publication date: 1-Jan-1976.
- Hunt H, Szymanski T and Ullman J (1975). On the complexity of LR(k) testing, Communications of the ACM, 18:12, (707-716), Online publication date: 1-Dec-1975.
- Jazayeri M, Ogden W and Rounds W (1975). The intrinsically exponential complexity of the circularity problem for attribute grammars, Communications of the ACM, 18:12, (697-706), Online publication date: 1-Dec-1975.
- Bitner J and Reingold E (1975). Backtrack programming techniques, Communications of the ACM, 18:11, (651-656), Online publication date: 1-Nov-1975.
- Graham S and Rhodes S (1975). Practical syntactic error recovery, Communications of the ACM, 18:11, (639-650), Online publication date: 1-Nov-1975.
- Aho A, Johnson S and Ullman J (1975). Deterministic parsing of ambiguous grammars, Communications of the ACM, 18:8, (441-452), Online publication date: 1-Aug-1975.
- Rosen B (1975). A Church-Rosser theorem for graph grammars, ACM SIGACT News, 7:3, (26-31), Online publication date: 1-Jul-1975.
- Lai-Wo Fung and King-Sun Fu (1975). Stochastic Syntactic Decoding for Pattern Classification, IEEE Transactions on Computers, 24:6, (662-667), Online publication date: 1-Jun-1975.
- Hunt H and Szymanski T On the complexity of grammar and related problems Proceedings of the seventh annual ACM symposium on Theory of computing, (54-65)
- Horowitz S (1975). A syntactic algorithm for peak detection in waveforms with applications to cardiography, Communications of the ACM, 18:5, (281-285), Online publication date: 1-May-1975.
- Hunt H, Szymanski T and Ullman J On the complexity of LR(k) testing Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (130-136)
- Kennedy K Node listings applied to data flow analysis Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (10-21)
- Schkolnick M (1974). The equivalence of reducing transition languages and deterministic languages, Communications of the ACM, 17:9, (517-520), Online publication date: 1-Sep-1974.
- Leeuwen J A partial solution to the reachability-problem for vector-addition systems Proceedings of the sixth annual ACM symposium on Theory of computing, (303-309)
- Hammer M A new grammatical transformation into LL(k) form (Extended Abstract) Proceedings of the sixth annual ACM symposium on Theory of computing, (266-275)
- Greibach S Some restrictions on W-grammars Proceedings of the sixth annual ACM symposium on Theory of computing, (256-265)
- Jones N and Laaser W Complete problems for deterministic polynomial time Proceedings of the sixth annual ACM symposium on Theory of computing, (40-46)
- Wegner P (1974). Modification of Aho and Ullman's correctness proof of Warshall's algorithm, ACM SIGACT News, 6:1, (32-35), Online publication date: 1-Jan-1974.
- Schkolnick M Labelled precedence parsing Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (33-40)
- Geller M and Harrison M Strict deterministic versus LR(0) parsing Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (22-32)
- LeBeux P Selection processes and their relation to automata Proceedings of the ACM annual conference, (336-341)
- Pratt V A linguistics oriented programming language Proceedings of the 3rd international joint conference on Artificial intelligence, (372-381)
- Teitelbaum R Context-free error analysis by evaluation of algebraic power series Proceedings of the fifth annual ACM symposium on Theory of computing, (196-199)
Index Terms
- The Theory of Parsing, Translation, and Compiling
Recommendations
Joint parsing and translation
COLING '10: Proceedings of the 23rd International Conference on Computational LinguisticsTree-based translation models, which exploit the linguistic syntax of source language, usually separate decoding into two steps: parsing and translation. Although this separation makes tree-based decoding simple and efficient, its translation ...
Syntactic parsing of clause constituents for statistical machine translation
The clause is considered as the basic unit of grammar in linguistics, which is a structure between a chunk and a sentence. Clause constituents, therefore, are one important kind of linguistically valid syntactic phrases. This paper adopts the CRFs model ...
LLLR parsing
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied ComputingThe idea of an LLLR parsing is presented. An LLLR(k) parser can be constructed for any LR(k) grammar but it produces the left parse of the input string in linear time (in respect to the length of the derivation) without backtracking. If used as a basis ...