1 ;;; tibet-util.el --- Support for inputting Tibetan characters
3 ;; Copyright (C) 1995 Electrotechnical Laboratory, JAPAN.
4 ;; Licensed to the Free Software Foundation.
6 ;; Keywords: multilingual, Tibetan
8 ;; This file is part of GNU Emacs.
10 ;; GNU Emacs is free software; you can redistribute it and/or modify
11 ;; it under the terms of the GNU General Public License as published by
12 ;; the Free Software Foundation; either version 2, or (at your option)
15 ;; GNU Emacs is distributed in the hope that it will be useful,
16 ;; but WITHOUT ANY WARRANTY; without even the implied warranty of
17 ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 ;; GNU General Public License for more details.
20 ;; You should have received a copy of the GNU General Public License
21 ;; along with GNU Emacs; see the file COPYING. If not, write to the
22 ;; Free Software Foundation, Inc., 59 Temple Place - Suite 330,
23 ;; Boston, MA 02111-1307, USA.
25 ;; Author: Toru TOMABECHI, <Toru.Tomabechi@orient.unil.ch>
27 ;; Created: Feb. 17. 1997
30 ;; 1997.03.13 Modification in treatment of text properties;
31 ;; Support for some special signs and punctuations.
36 (defun setup-tibetan-environment ()
38 (set-language-environment "Tibetan"))
40 ;;; This function makes a transcription string for
41 ;;; re-composing a character.
44 (defun tibetan-tibetan-to-transcription (ch)
45 "Return a transcription string of Tibetan character CH"
47 (l (append tibetan-consonant-transcription-alist
48 tibetan-vowel-transcription-alist
49 tibetan-precomposed-transcription-alist
50 tibetan-subjoined-transcription-alist
))
51 decomp-l t-char trans str result
)
52 (if (eq (char-charset char
) 'composition
)
53 (setq decomp-l
(decompose-composite-char char
'list nil
))
54 (setq decomp-l
(cons char nil
)))
57 (setq t-char
(char-to-string (car decomp-l
)))
58 (setq trans
(car (rassoc t-char l
)))
59 (setq str
(concat str trans
))
60 (setq decomp-l
(cdr decomp-l
)))
63 ;;; This function translates transcription string into a string of
64 ;;; Tibetan characters.
67 (defun tibetan-transcription-to-tibetan (transcription)
68 "Translate Roman transcription into a sequence of Tibetan components."
69 (let ((trans transcription
)
70 (lp tibetan-precomposed-transcription-alist
)
71 (l (append tibetan-consonant-transcription-alist
72 tibetan-vowel-transcription-alist
73 tibetan-subjoined-transcription-alist
))
74 (case-fold-search nil
)
75 substr t-char p-str t-str result
)
79 (cond ((string-match tibetan-precomposed-regexp trans
)
80 (setq substr
(substring trans
(match-beginning 0) (match-end 0)))
81 (setq trans
(substring trans
(match-end 0)))
82 (setq t-char
(cdr (assoc substr lp
)))
84 (while (string-match tibetan-regexp trans
)
85 (setq substr
(substring trans
(match-beginning 0) (match-end 0)))
86 (setq trans
(substring trans
0 (match-beginning 0)))
88 (cdr (assoc substr l
)))
89 (setq t-str
(concat t-char t-str
)))
90 (setq result
(concat p-str t-str
))))
94 ;;; Functions for composing Tibetan character.
96 ;;; A Tibetan syllable is typically structured as follows:
98 ;;; [Prefix] C [C+] V [M] [Suffix [Post suffix]]
100 ;;; where C's are all vertically stacked, V appears below or above
101 ;;; consonant cluster and M is always put above the C[C+]V combination.
102 ;;; (Sanskrit visarga, though it is a vowel modifier, is considered
103 ;;; to be a punctuation.)
105 ;;; Here are examples of the words "bsgrubs" and "h'uM"
107 ;;; \e$(7"7\e(B\e2\e$(7%q`"U\e(B\e1\e$(7"7"G\e(B \e2\e$(7"H`#A`"U0"_\e(B\e1
115 ;;; Consonants ''', 'w', 'y', 'r' take special forms when they are used
116 ;;; as subjoined consonant. Consonant 'r' takes another special form
117 ;;; when used as superjoined as in "rka", and so on, while it does not
118 ;;; change its form when conjoined with subjoined ''', 'w' or 'y'
119 ;;; as in "rwa", "rya".
122 ;;; As a Tibetan input method should avoid using conversion key,
123 ;;; we use a "Tibetan glyph -> transcription -> Tibetan glyph"
124 ;;; translation at each key input.
126 ;;; 1st stage - Check the preceding char.
127 ;;; If the preceding char is Tibetan and composable, then
129 ;;; 2nd stage - Translate the preceding char into transcription
131 ;;; 3rd stage - Concatenate the transcription of preceding char
132 ;;; and the current input key.
134 ;;; 4th stage - Re-translate the concatenated transcription into
135 ;;; a sequence of Tibetan letters.
137 ;;; 5th stage - Convert leading consonants into one single precomposed char
140 ;;; 6th stage - Compose the consonants into one composite glyph.
142 ;;; (If the current input is a vowel sign or a vowel modifier,
143 ;;; then it is composed with preceding char without checking
144 ;;; except when the preceding char is a punctuation or a digit.)
148 ;;; This function is used to avoid composition
149 ;;; between Tibetan and non-Tibetan chars.
152 (defun tibetan-char-examin (ch)
153 "Check if char CH is Tibetan character.
154 Returns non-nil if CH is Tibetan. Otherwise, returns nil."
156 (if (eq (char-charset chr
) 'composition
)
157 (string-match "\\cq+" (decompose-composite-char chr
))
158 (string-match "\\cq" (char-to-string chr
)))))
160 ;;; This is used to avoid composition between digits, signs, punctuations
161 ;;; and word constituents.
164 (defun tibetan-composable-examin (ch)
165 "Check if Tibetan char CH is composable.
166 Returns t if CH is a composable char \(i.e. neither punctuation nor digit)."
169 (if (eq (char-charset chr
) 'composition
)
170 (setq chstr
(decompose-composite-char chr
))
171 (setq chstr
(char-to-string chr
)))
172 (not (string-match "[\e$(7!1\e(B-\e$(7!o"f
\e$
(8!;!=!?!@!A!D"`\e(B]" chstr))))
175 ;;; This checks if a character to be composed contains already
176 ;;; one or more vowels / vowel modifiers. If the character contains
177 ;;; them, then no more consonant should be added.
180 (defun tibetan-complete-char-examin (ch)
181 "Check if composite char CH contains one or more vowel/vowel modifiers.
182 Returns non-nil, if CH contains vowel/vowel modifiers."
185 (if (eq (char-charset chr
) 'composition
)
186 (setq chstr
(decompose-composite-char chr
))
187 (setq chstr
(char-to-string chr
)))
188 (string-match "[\e$(7!g!e"Q
\e(B-\e$
(7"^"_
\e(B-\e$
(7"l\e(B]" chstr
)))
190 ;;; This function makes a composite character consisting of two characters
191 ;;; vertically stacked.
194 (defun tibetan-vertical-stacking (first second upward
)
195 "Return a vertically stacked composite char consisting of FIRST and SECOND.
196 If UPWARD is non-nil, then SECOND is put above FIRST."
199 (setq l
(decompose-composite-char first
'list t
))
200 (setq l
(list first
)))
202 (setq rule
(list '(tc . bc
)))
203 (setq rule
(list '(bc . tc
))))
204 (setq l
(append l rule
(list second
)))
205 (apply 'compose-chars l
)))
207 ;;; This function makes a composite char from a string.
208 ;;; Note that this function returns a string, not a char.
211 (defun tibetan-compose-string (str)
212 "Compose a sequence of Tibetan character components into a composite character.
213 Returns a string containing a composite character."
215 f-str s-str f-ch s-ch rest composed result
)
216 ;;Make sure no redundant vowel sign is present.
218 "^\\(.+\\)\\(\e$(7"Q
\e(B\\)\\([\e$
(7!I
!g
!e
"Q\e(B-\e$(7"^
"_\e(B-\e$(7"l
\e(B]\\)" t-str)
220 (match-string 1 t-str)
221 (match-string 3 t-str))))
223 "^
\\(.
+\\)\\([\e$
(7!I
!g
!e
"Q\e(B-\e$(7"^
"_\e(B-\e$(7"l
\e(B]\\)\\(\e$
(7"Q\e(B\\)" t-str
)
225 (match-string 1 t-str
)
226 (match-string 2 t-str
))))
229 ;; Consecutive base/precomposed consonants are reduced to the last one.
230 (while (string-match "^\\([\e$(7"!\e(B-\e$
(7"J$!\e(B-\e$(7%u\e(B]\\)\\([\e$(7"!\e(B-\e$
(7"@"B
\e(B-\e$
(7"J$!\e(B-\e$(7%u\e(B].*\\)" t-str
)
231 (setq result
(concat result
(match-string 1 t-str
)))
232 (setq t-str
(match-string 2 t-str
)))
233 ;; Vowel/vowel modifier, subjoined consonants are added one by one
234 ;; to the preceding element.
236 (string-match "^\\(.\\)\\([\e$(7"A
#!\e(B-\e$
(7#J
!I
!g
!e
"Q\e(B-\e$(7"^
"_\e(B-\e$(7"l
\e(B]\\)\\(.
*\\)" t-str)
237 (setq f-str (match-string 1 t-str))
238 (setq f-ch (string-to-char f-str))
239 (setq s-str (match-string 2 t-str))
240 ;;Special treatment for 'a chung.
241 ;;If 'a follows a consonant, then turned into its subjoined form.
242 (if (and (string-match "\e$
(7"A\e(B" s-str
)
243 (not (tibetan-complete-char-examin f-ch
)))
244 (setq s-str
"\e$(7#A\e(B"))
245 (setq s-ch
(string-to-char s-str
))
246 (setq rest
(match-string 3 t-str
))
247 (cond ((string-match "\\c2" s-str
);; upper vowel sign
249 (tibetan-vertical-stacking f-ch s-ch t
)))
250 ((string-match "\\c3" s-str
);; lower vowel sign
252 (tibetan-vertical-stacking f-ch s-ch nil
)))
253 ;;Automatic conversion of ra-mgo (superscribed r).
254 ;;'r' is converted if followed by a subjoined consonant
255 ;;other than w, ', y, r.
256 ((and (string-match "\e$(7"C
\e(B" f-str)
257 (not (string-match "[\e$
(7#>#A
#B
#C
\e(B]" s-str)))
258 (setq f-ch ?\e$(7#P\e(B)
260 (tibetan-vertical-stacking f-ch s-ch nil)))
261 ((not (tibetan-complete-char-examin f-ch))
262 ;;Initial base consonant is tranformed, if followed by
263 ;;a subjoined consonant, except when it is followed
264 ;;by a subscribed 'a.
265 (if (and (string-match "[\e$
(7"!\e(B-\e$(7"="?"@"D\e(B-\e$(7"J
\e(B]" f-str)
266 (not (string-match "\e$
(7#A
\e(B" s-str)))
269 (cdr (assoc f-str tibetan-base-to-subjoined-alist)))))
271 (tibetan-vertical-stacking f-ch s-ch nil)))
273 (setq composed s-str)
274 (setq result (concat result f-str))))
275 (setq t-str (concat composed rest)))
276 (setq result (concat result t-str))))
278 ;;; quail <-> conversion interface.
281 (defun tibetan-composition (pc key)
282 "Interface to quail input method.
283 Takes two arguments
: char PC and string KEY
, where PC is the preceding
284 character to be composed with current input KEY.
285 Returns a string which is the result of composition.
"
286 (let (trans cur-ch t-str result)
287 ;; Make a tibetan character corresponding to current input key.
288 (setq cur-ch (tibetan-transcription-to-tibetan key))
289 ;; Check if the preceding character is Tibetan and composable.
290 (cond ((and (tibetan-char-examin pc)
291 (tibetan-composable-examin pc))
292 ;;If Tibetan char corresponding to the current input key exists,
295 ;; Convert the preceding character into transcription,
296 ;; and concatenate it with the current input key,
297 (setq trans (tibetan-tibetan-to-transcription pc))
298 (setq trans (concat trans key))
299 ;; Concatenated transcription is converted to
300 ;; a sequence of Tibetan characters,
301 (setq t-str (tibetan-transcription-to-tibetan trans))
302 ;; And it is composed into a composite character.
303 (setq result (tibetan-compose-string t-str)))
306 ;; Simply concatenate the preceding character and
307 ;; the current input key.
308 (setq result (char-to-string pc))
309 (setq result (concat result key)))))
310 ;; If the preceding char is not Tibetan or not composable,
312 ;; pc = 0 means the point is at the beginning of buffer.
314 (setq result (char-to-string pc)))
316 (setq result (concat result cur-ch))
317 (setq result (concat result key))))
322 (defun tibetan-decompose-region (beg end)
323 "Decompose Tibetan characters in the region BEG END into their components.
324 Components are
: base and subjoined consonants
, vowel signs
, vowel modifiers.
325 One column punctuations are converted to their
2 column equivalents.
"
327 (let (ch-str ch-beg ch-end)
330 (narrow-to-region beg end)
331 (goto-char (point-min))
332 ;; \\cq = Tibetan character
333 (while (re-search-forward "\\cq
" nil t)
334 (setq ch-str (buffer-substring-no-properties
335 (match-beginning 0) (match-end 0)))
336 ;; Save the points. Maybe, using save-match-data is preferable.
337 ;; But in order not to lose the trace(because the body is too long),
338 ;; we save the points in variables.
339 (setq ch-beg (match-beginning 0))
340 (setq ch-end (match-end 0))
341 ;; Here starts the decomposition.
343 ;; 1 column punctuations -> 2 column equivalent
344 ((string-match "[\e$
(8!D
!;!=!?!@!A"`\e(B]" ch-str)
346 (car (rassoc ch-str tibetan-precomposition-rule-alist
))))
347 ;; Decomposition of composite character.
348 ((eq (char-charset (string-to-char ch-str
)) 'composition
)
349 ;; Make a string which consists of a sequence of
351 (setq ch-str
(decompose-composite-char (string-to-char ch-str
)))
352 ;; Converts nyi zla into base elements.
353 (cond ((string= ch-str
"\e$(7#R#S#S#S\e(B")
354 (setq ch-str
"\e$(7!4!5!5\e(B"))
355 ((string= ch-str
"\e$(7#R#S#S\e(B")
356 (setq ch-str
"\e$(7!4!5\e(B"))
357 ((string= ch-str
"\e$(7#R#S!I\e(B")
358 (setq ch-str
"\e$(7!6\e(B"))
359 ((string= ch-str
"\e$(7#R#S\e(B")
360 (setq ch-str
"\e$(7!4\e(B")))))
361 ;; If the sequence of components starts with a subjoined consonants,
362 (if (string-match "^\\([\e$(7#!\e(B-\e$(7#J\e(B]\\)\\(.*\\)$" ch-str
)
363 ;; then the first components is converted to its base form.
365 (concat (car (rassoc (match-string 1 ch-str
)
366 tibetan-base-to-subjoined-alist
))
367 (match-string 2 ch-str
))))
368 ;; If the sequence of components starts with a precomposed character,
369 (if (string-match "^\\([\e$(7$!\e(B-\e$(7%u\e(B]\\)\\(.*\\)$" ch-str
)
370 ;; then it is converted into a sequence of components.
372 (concat (car (rassoc (match-string 1 ch-str
)
373 tibetan-precomposition-rule-alist
))
374 (match-string 2 ch-str
))))
375 ;; Special treatment for superscribed r.
376 (if (string-match "^\e$(7#P\e(B\\(.*\\)$" ch-str
)
377 (setq ch-str
(concat "\e$(7"C
\e(B" (match-string 1 ch-str))))
378 ;; Finally, the result of decomposition is inserted, and
379 ;; the composite character is deleted.
380 (insert-and-inherit ch-str)
381 (delete-region ch-beg ch-end))))))
384 (defun tibetan-compose-region (beg end)
385 "Make composite chars from Tibetan character components in the region BEG END.
386 Two column punctuations are converted to their
1 column equivalents.
"
391 (narrow-to-region beg end)
392 (goto-char (point-min))
393 ;; First, sequence of components which has a precomposed equivalent
395 (while (re-search-forward
396 tibetan-precomposition-rule-regexp nil t)
397 (setq str (buffer-substring-no-properties
398 (match-beginning 0) (match-end 0)))
401 (cdr (assoc str tibetan-precomposition-rule-alist))))
402 (delete-region (match-beginning 0) (match-end 0)))
403 (goto-char (point-min))
404 ;; Then, composable elements are put into a composite character.
405 (while (re-search-forward
406 "[\e$
(7"!\e(B-\e$(7"J$
!\e(B-\e$
(7%u
\e(B]+[\e$
(7#!\e(B-\e$
(7#J
!I
!g
!e
"Q\e(B-\e$(7"^
"_\e(B-\e$(7"l
\e(B]+"
408 (setq str (buffer-substring-no-properties
409 (match-beginning 0) (match-end 0)))
411 (setq result (tibetan-compose-string str))
412 (insert-and-inherit result))
413 (delete-region (match-beginning 0) (match-end 0)))))))
416 ;;; This variable is used to avoid repeated decomposition.
418 (setq-default tibetan-decomposed nil)
421 (defun tibetan-decompose-buffer ()
422 "Decomposes Tibetan characters in the buffer into their components.
423 See also docstring of the function tibetan-decompose-region.
"
425 (make-local-variable 'tibetan-decomposed)
426 (cond ((not tibetan-decomposed)
427 (tibetan-decompose-region (point-min) (point-max))
428 (setq tibetan-decomposed t))))
431 (defun tibetan-compose-buffer ()
432 "Composes Tibetan character components in the buffer.
433 See also docstring of the function tibetan-compose-region.
"
435 (make-local-variable 'tibetan-decomposed)
436 (tibetan-compose-region (point-min) (point-max))
437 (setq tibetan-decomposed nil))
440 (defun tibetan-post-read-conversion (len)
443 (let ((buffer-modified-p (buffer-modified-p)))
444 (narrow-to-region (point) (+ (point) len))
445 (tibetan-compose-region (point-min) (point-max))
446 (set-buffer-modified-p buffer-modified-p)
447 (make-local-variable 'tibetan-decomposed)
448 (setq tibetan-decomposed nil)
449 (- (point-max) (point-min))))))
453 (defun tibetan-pre-write-conversion (from to)
454 (setq tibetan-decomposed-temp tibetan-decomposed)
455 (let ((old-buf (current-buffer)))
456 (set-buffer (generate-new-buffer " *temp
*"))
459 (insert-buffer-substring old-buf from to))
460 (if (not tibetan-decomposed-temp)
461 (tibetan-decompose-region (point-min) (point-max)))
462 ;; Should return nil as annotations.
465 (provide 'tibet-util)
467 ;;; language/tibet-util.el ends here.