Laboratório de Linguagens e Técnicas Adaptativas
- 74493 Acessos
São Paulo/SP, 25 de Abril de 2014
Principal
Apresentação
Roteiro de estudos
Colaboradores
Notícias
Downloads
WTA 2008
Periódicos
Eventos
Café com o Prof. João
Workshops
WTA 2007
WTA 2008
WTA 2009
WTA 2010
WTA 2011
WTA 2012
WTA 2013
WTA 2014
Publicações
Artigos
Monografias e Projetos de Formatura
Teses e Dissertações
Temas correlatos
Diversos
Lista de discussão
Oportunidades
Material Didático
Áreas correlatas
Bibliotecas digitais
Página anterior
FASTAR
Documento sem título
Temas correlatos

  • Boullier, Pierre. Dynamic Grammars and Semantic Analysis. INRIA Research Report 2322, August 1994.(html).
  • Burshteyn, B. On the Modification of the Formal Grammar at Parse Time ACM SIGPLAN Notices, v. 25, n. 5, p. 117-23, 1990.
  • Burshteyn, B. Generation and Recognition of Formal Languages by Modifiable Grammars ACM SIGPLAN Notices, v. 25, n. 12, p. 45-53, 1990.
  • Burshteyn, B. USSA - Universal Syntax and Semantics Analyser ACM SIGPLAN Notices, v. 27, n. 1, p. 42-60, 1992.
  • Cabasino, S.; Paolucci, P. Sp. and Todesco, G. M. Dynamic Parsers and Evolving Grammars ACM SIGPLAN Notices, v. 27, n. 11, p. 39-48, 1992.
  • Christiansen, H. Recognition of Generative Languages Lecture Notes in Computer Science, 217, p. 63-81, New York: Springer-Verlag, 1986.
  • Christiansen, H.; Shaw, C. J. A Survey of Adaptable Grammars ACM SIGPLAN Notices, vol. 25, n. 11, p. 35-44, 1990.(html).
  • Christiansen, H. Why should grammars not adapt themselves to context and discourse? Abstract collection, 4th International Pragmatics Conference - International Pragmatics Association, Kobe, Japan, July 23.-30. 1993.
  • Forini, A.C. di Some remarks on the syntax of symbolic programming languages Communications of the ACM, 6, pp. 456-460, 1963.
  • Hanford, K.V. and Jones, C.B. Dynamic syntax: A concept for the definition of the syntax of programming languages. Annual Review in Automatic Programming, 7, pp. 115-142. Pergamon Press, Oxford, 1973.
  • Jackson, Quinn Tyler. Adaptive Grammar. Wikipedia - The Free Encyclopedia. October, 2006 (html).
  • Jackson, Quinn Tyler. Adapting to Babel: Adaptivity & Context-Sensitivity in Parsing. Ibis Publishing. March, 2006 (Book Page).
  • Jackson, Quinn Tyler and Langan, Christopher Michael. Adaptive Predicates in Empty-Start Natural Language Parsing Noesis-E, v. 1, n. 6, November, 2001 (Citeseer).
  • Jackson, Quinn Tyler. Adaptive Predicates in Natural Language Parsing Perfection, n. 4, 2000 (Citeseer).
  • Klein, A. and Kutrib, M. Self-Assembling Finite Automata In O. H. Ibarra, L. Zhang (eds.): Computing and Combinatorics (COCOON 2002), LNCS 2387, Springer 2002, 310-3 (ps.gz).
  • Mason, K.P. Dynamic Template Translators: A useful model for the definition of programming languages Ph.D. thesis, University of Adelaide, Australia, 1984.
  • Mason, K.P. Dynamic template translators - A new device for specifying programming languages. International Journal of Computer Math, 22, pp. 199-212, 1987.
  • Roberts, G.H. A Note on Modifiable Grammars ACM SIGPLAN Notices, v. 26, n. 3, p. 18, 1991.
  • Rubinstein, R. and Shutt, J. N. Self-Modifying Finite Automata: Basic Definitions and Results Techincal Report WPI-CS-TR-95-2, Worcester Polytechnic Institute, Worcester, Massachusetts, August, 1995 (pdf).
  • Rubinstein, R. and Shutt, J. N. Self-Modifying Finite Automata: An Introduction Information Processing Letters, v. 56, n. 4, p. 185-190, 1995.
  • Rubinstein, R. and Shutt, J. N. Self-Modifying Finite Automata IN: Pehrson, B. and Simon, I. (eds),Technology and Foundations: Information 94. v. 1: Proceeding of the 13th IFIP World Computer Congress, p. 493-498, Amsterdam: North-Holland, 1994. (Citeseer).
  • Rubinstein, R. and Shutt, J. N. Self-Modifying Finite Automata Techinical Report WPI-CS-TR-93-11, Worcester Polytechnic Institute, Worcester, Massachusetts, December, 1993 (pdf).
  • Sekar, R. C.; Ramesh, R. and Ramakrishnan, I. V. Adaptive Pattern Matching SIAM Journal of Computing, Dec 1995 (ps).
  • Shutt, J. N. Recursive Adaptable Grammars. Techincal Report WPI-CS-TR-99-03, Worcester Polytechnic Institute, Worcester, Massachusetts, January, 1999 (pdf).
  • Shutt, J. N. Self-Modifying Finite Automata: Power and Limitations Techincal Report WPI-CS-TR-95-4, Worcester Polytechnic Institute, Worcester, Massachusetts, August, 1995 (pdf).
  • Shutt, J. N. Recursive Adaptable Grammars. Masther Thesis, Worcester Polytechnic Institute, Worcester, Massachusetts, 1993 (html)
  • Standish, T.A. Extensibility in Programming Language Design ACM SIGPLAN Notices, p. 18-21, vol 10 n. 7, July, 1975.
  • Wegbreit, B Extensible programming languages Harward University, Cambridge, Massachusetts, Garland Publishing Inc., New York & London, 1980.