Abstract | ||
---|---|---|
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming
claim the ability of writing parsers in a natural and concise way. We address here the task from a functional-logic perspective.
By modelling parsers as non-deterministic functions we achieve a very natural manner of building parsers, which combines the
nicest properties of the functional and logic approaches. In particular, we are able to define parsers within our framework
in a style very close to that of functional programming parsers, but using simpler concepts. Moreover, we have moved beyond
usual declarative approaches to parsers, since the functional-logic parsers presented here can be considered as truly data
values. As an example of this feature we define a function that detects ambiguous grammars.
|
Year | DOI | Venue |
---|---|---|
1999 | 10.1007/10705424_6 | Fuji International Symposium on Functional and Logic Programming |
Keywords | Field | DocType |
functional-logic perspective,functional programming,declarative programming | Rule-based machine translation,Parse tree,Programming language,LR parser,Expression (mathematics),Functional programming,Computer science,Natural language processing,Artificial intelligence,Declarative programming,Algorithm,Parsing,AND gate | Conference |
Volume | ISSN | ISBN |
1722 | 0302-9743 | 3-540-66677-X |
Citations | PageRank | References |
15 | 0.64 | 11 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rafael Caballero | 1 | 27 | 4.02 |
Francisco Javier López-fraguas | 2 | 436 | 25.21 |