The Complexity of LALR (k) Testing
1983; Association for Computing Machinery; Volume: 30; Issue: 2 Linguagem: Inglês
10.1145/322374.322376
ISSN1557-735X
AutoresSeppo Sippu, Eljas Soisalon-Soininen, Esko Ukkonen,
Tópico(s)Model-Driven Software Engineering Techniques
Resumoarticle Free AccessThe Complexity of LALR(k) Testing Authors: Seppo Sippu Department of Computer Science, University of Helsinki, Tukholmankatu 2, SF-00250, Helsinki 25, Finland Department of Computer Science, University of Helsinki, Tukholmankatu 2, SF-00250, Helsinki 25, FinlandView Profile , Eljas Soisalon-Soininen Department of Computer Science, University of Helsinki, Tukholmankatu 2, SF-00250, Helsinki 25, Finland Department of Computer Science, University of Helsinki, Tukholmankatu 2, SF-00250, Helsinki 25, FinlandView Profile , Esko Ukkonen Department of Computer Science, University of Helsinki, Tukholmankatu 2, SF-00250, Helsinki 25, Finland Department of Computer Science, University of Helsinki, Tukholmankatu 2, SF-00250, Helsinki 25, FinlandView Profile Authors Info & Claims Journal of the ACMVolume 30Issue 2April 1983 pp 259–270https://doi.org/10.1145/322374.322376Published:01 April 1983Publication History 5citation440DownloadsMetricsTotal Citations5Total Downloads440Last 12 Months11Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Referência(s)