author | wenzelm |
Thu, 07 Jul 2011 23:55:15 +0200 | |
changeset 43698 | 91c4d7397f0e |
parent 43695 | 5130dfe1b7be |
child 45900 | 793bf5fa5fbf |
permissions | -rw-r--r-- |
31763 | 1 |
/* Title: Pure/Thy/completion.scala |
2 |
Author: Makarius |
|
3 |
||
4 |
Completion of symbols and keywords. |
|
5 |
*/ |
|
6 |
||
7 |
package isabelle |
|
8 |
||
9 |
import scala.util.matching.Regex |
|
10 |
import scala.util.parsing.combinator.RegexParsers |
|
11 |
||
12 |
||
13 |
private object Completion |
|
14 |
{ |
|
15 |
/** word completion **/ |
|
16 |
||
17 |
val word_regex = "[a-zA-Z0-9_']+".r |
|
18 |
def is_word(s: CharSequence): Boolean = word_regex.pattern.matcher(s).matches |
|
19 |
||
20 |
object Parse extends RegexParsers |
|
21 |
{ |
|
22 |
override val whiteSpace = "".r |
|
23 |
||
43462 | 24 |
def reverse_symbol: Parser[String] = """>[A-Za-z0-9_']+\^?<\\""".r |
25 |
def reverse_symb: Parser[String] = """[A-Za-z0-9_']{2,}\^?<\\""".r |
|
40533
e38e80686ce5
somewhat adhoc replacement for 'thus' and 'hence';
wenzelm
parents:
37072
diff
changeset
|
26 |
def word: Parser[String] = "[a-zA-Z0-9_']{2,}".r |
31763 | 27 |
|
28 |
def read(in: CharSequence): Option[String] = |
|
29 |
{ |
|
37072
9105c8237c7a
renamed "rev" to "reverse" following usual Scala conventions;
wenzelm
parents:
36012
diff
changeset
|
30 |
val reverse_in = new Library.Reverse(in) |
9105c8237c7a
renamed "rev" to "reverse" following usual Scala conventions;
wenzelm
parents:
36012
diff
changeset
|
31 |
parse((reverse_symbol | reverse_symb | word) ^^ (_.reverse), reverse_in) match { |
31763 | 32 |
case Success(result, _) => Some(result) |
33 |
case _ => None |
|
34 |
} |
|
35 |
} |
|
36 |
} |
|
37 |
} |
|
38 |
||
39 |
class Completion |
|
40 |
{ |
|
41 |
/* representation */ |
|
42 |
||
31780 | 43 |
protected val words_lex = Scan.Lexicon() |
44 |
protected val words_map = Map[String, String]() |
|
31763 | 45 |
|
31780 | 46 |
protected val abbrevs_lex = Scan.Lexicon() |
47 |
protected val abbrevs_map = Map[String, (String, String)]() |
|
31763 | 48 |
|
49 |
||
50 |
/* adding stuff */ |
|
51 |
||
40533
e38e80686ce5
somewhat adhoc replacement for 'thus' and 'hence';
wenzelm
parents:
37072
diff
changeset
|
52 |
def + (keyword: String, replace: String): Completion = |
31763 | 53 |
{ |
54 |
val old = this |
|
55 |
new Completion { |
|
56 |
override val words_lex = old.words_lex + keyword |
|
40533
e38e80686ce5
somewhat adhoc replacement for 'thus' and 'hence';
wenzelm
parents:
37072
diff
changeset
|
57 |
override val words_map = old.words_map + (keyword -> replace) |
31763 | 58 |
override val abbrevs_lex = old.abbrevs_lex |
59 |
override val abbrevs_map = old.abbrevs_map |
|
60 |
} |
|
61 |
} |
|
62 |
||
40533
e38e80686ce5
somewhat adhoc replacement for 'thus' and 'hence';
wenzelm
parents:
37072
diff
changeset
|
63 |
def + (keyword: String): Completion = this + (keyword, keyword) |
e38e80686ce5
somewhat adhoc replacement for 'thus' and 'hence';
wenzelm
parents:
37072
diff
changeset
|
64 |
|
43695
5130dfe1b7be
simplified Symbol based on lazy Symbol.Interpretation -- reduced odd "functorial style";
wenzelm
parents:
43462
diff
changeset
|
65 |
def add_symbols: Completion = |
31763 | 66 |
{ |
67 |
val words = |
|
43695
5130dfe1b7be
simplified Symbol based on lazy Symbol.Interpretation -- reduced odd "functorial style";
wenzelm
parents:
43462
diff
changeset
|
68 |
(for ((x, _) <- Symbol.names) yield (x, x)).toList ::: |
5130dfe1b7be
simplified Symbol based on lazy Symbol.Interpretation -- reduced odd "functorial style";
wenzelm
parents:
43462
diff
changeset
|
69 |
(for ((x, y) <- Symbol.names) yield (y, x)).toList ::: |
5130dfe1b7be
simplified Symbol based on lazy Symbol.Interpretation -- reduced odd "functorial style";
wenzelm
parents:
43462
diff
changeset
|
70 |
(for ((x, y) <- Symbol.abbrevs if Completion.is_word(y)) yield (y, x)).toList |
31763 | 71 |
|
72 |
val abbrs = |
|
43695
5130dfe1b7be
simplified Symbol based on lazy Symbol.Interpretation -- reduced odd "functorial style";
wenzelm
parents:
43462
diff
changeset
|
73 |
(for ((x, y) <- Symbol.abbrevs if !Completion.is_word(y)) |
31765 | 74 |
yield (y.reverse.toString, (y, x))).toList |
31763 | 75 |
|
76 |
val old = this |
|
77 |
new Completion { |
|
78 |
override val words_lex = old.words_lex ++ words.map(_._1) |
|
31765 | 79 |
override val words_map = old.words_map ++ words |
31763 | 80 |
override val abbrevs_lex = old.abbrevs_lex ++ abbrs.map(_._1) |
81 |
override val abbrevs_map = old.abbrevs_map ++ abbrs |
|
82 |
} |
|
83 |
} |
|
84 |
||
85 |
||
86 |
/* complete */ |
|
87 |
||
31765 | 88 |
def complete(line: CharSequence): Option[(String, List[String])] = |
31763 | 89 |
{ |
34141 | 90 |
abbrevs_lex.parse(abbrevs_lex.keyword, new Library.Reverse(line)) match { |
37072
9105c8237c7a
renamed "rev" to "reverse" following usual Scala conventions;
wenzelm
parents:
36012
diff
changeset
|
91 |
case abbrevs_lex.Success(reverse_a, _) => |
9105c8237c7a
renamed "rev" to "reverse" following usual Scala conventions;
wenzelm
parents:
36012
diff
changeset
|
92 |
val (word, c) = abbrevs_map(reverse_a) |
35004
b89a31957950
filter out identical completions only after symbols.decode -- recover completion of literal symbols (e.g. \<AA>);
wenzelm
parents:
34141
diff
changeset
|
93 |
Some(word, List(c)) |
31765 | 94 |
case _ => |
95 |
Completion.Parse.read(line) match { |
|
96 |
case Some(word) => |
|
35004
b89a31957950
filter out identical completions only after symbols.decode -- recover completion of literal symbols (e.g. \<AA>);
wenzelm
parents:
34141
diff
changeset
|
97 |
words_lex.completions(word).map(words_map(_)) match { |
31765 | 98 |
case Nil => None |
36012 | 99 |
case cs => Some(word, cs.sortWith(_ < _)) |
31765 | 100 |
} |
101 |
case None => None |
|
102 |
} |
|
103 |
} |
|
31763 | 104 |
} |
105 |
} |