Biblioteca Digital do IPB >
Escola Superior de Tecnologia e Gestão >
Informática e Comunicações >
IC - Artigos em Proceedings Não Indexados ao ISI/Scopus >
Please use this identifier to cite or link to this item:
|Título: ||PFTL: a systematic approach for describing filesystem tree processors|
|Autor: ||Carvalho, Nuno|
Almeida, José João
Pereira, Maria João
|Palavras-chave: ||Grammatical approaches|
|Issue Date: ||2011|
|Citação: ||Carvalho, Nuno; Simões, Alberto; Almeida, João; Henriques, Pedro; Pereira, Maria João (2011) - PFTL: a systematic approach for describing file system tree processors. In INForum'11 --- Simpósio de Informática (CoRTA'11 track). Universidade de Coimbra|
|Resumo: ||Today, most developers prefer to store information in databases. But plain filesystems were used for years, and are still used, to store information, commonly in files of heterogeneous formats that are organized in directory trees.
This approach is a very flexible and natural way to create hierarchical organized structures of documents.
We can devise a formal notation to describe a filesystem tree structure, similar to a grammar, assuming that filenames can be considered terminal symbols, and directory names non-terminal symbols. This specification would allow to derive correct language sentences (combination of terminal symbols) and to associate semantic actions, that can produce arbitrary side effects, to each valid sentence, just as we do in common parser generation tools. These specifications can be used to systematically process files in directory trees, and the final result depends on the semantic actions associated with each production rule.
In this paper we revamped an old idea of using a domain specific language to implement these specifications similar to context free grammars. And introduce some examples of applications that can be built using this approach.|
|Arbitragem científica: ||yes|
|Appears in Collections:||IC - Artigos em Proceedings Não Indexados ao ISI/Scopus|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.