| 12
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
 100
 101
 102
 103
 104
 105
 106
 107
 108
 109
 110
 111
 112
 113
 114
 115
 116
 117
 118
 119
 120
 121
 122
 123
 124
 125
 126
 127
 128
 129
 
 | //@beginlicenses@
//@license{chiba-tokyo}{}@
//@license{xerox}{}@
//@license{contributors}{}@
//
//  Copyright (C) 1997-2001 Shigeru Chiba, Tokyo Institute of Technology.
//
//  Permission to use, copy, distribute and modify this software and
//  its documentation for any purpose is hereby granted without fee,
//  provided that the above copyright notice appears in all copies and that
//  both that copyright notice and this permission notice appear in
//  supporting documentation.
//
//  Shigeru Chiba makes no representations about the suitability of this
//  software for any purpose.  It is provided "as is" without express or
//  implied warranty.
//
//  -----------------------------------------------------------------
//
//
//  Copyright (c) 1995, 1996 Xerox Corporation.
//  All Rights Reserved.
//
//  Use and copying of this software and preparation of derivative works
//  based upon this software are permitted. Any copy of this software or
//  of any derivative work must include the above copyright notice of   
//  Xerox Corporation, this paragraph and the one after it.  Any
//  distribution of this software or derivative works must comply with all
//  applicable United States export control laws.
//
//  This software is made available AS IS, and XEROX CORPORATION DISCLAIMS
//  ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION THE  
//  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR    
//  PURPOSE, AND NOTWITHSTANDING ANY OTHER PROVISION CONTAINED HEREIN, ANY
//  LIABILITY FOR DAMAGES RESULTING FROM THE SOFTWARE OR ITS USE IS
//  EXPRESSLY DISCLAIMED, WHETHER ARISING IN CONTRACT, TORT (INCLUDING
//  NEGLIGENCE) OR STRICT LIABILITY, EVEN IF XEROX CORPORATION IS ADVISED
//  OF THE POSSIBILITY OF SUCH DAMAGES.
//
//  -----------------------------------------------------------------
//
//  Permission to use, copy, distribute and modify this software and its  
//  documentation for any purpose is hereby granted without fee, provided that
//  the above copyright notice appears in all copies and that both that copyright
//  notice and this permission notice appear in supporting documentation.
// 
//  Other Contributors (see file AUTHORS) make(s) no representations about the suitability of this
//  software for any purpose. It is provided "as is" without express or implied
//  warranty.
//  
//  Copyright (C)  Other Contributors (see file AUTHORS)
//
//@endlicenses@
// Part of the implementation of QuoteClass is in metaclass.cc.
#include <string.h>
#include <opencxx/parser/ptreeAll.h>
#include <opencxx/QuoteClass.h>
#include <opencxx/parser/ProgramString.h>
using namespace std;
namespace Opencxx
{
Ptree* QuoteClass::TranslateMemberCall(Environment* env,
				       Ptree* member, Ptree* args)
{
    Ptree* name = StripClassQualifier(member);
    char* str;
    if(PtreeUtil::Eq(name, "qMake")){
	Ptree* arg1 = PtreeUtil::First(PtreeUtil::Second(args));
	if(arg1->Reify(str) && str != 0)
	    return ProcessBackQuote(env, str, arg1, name);
	else
	    ErrorMessage(env, "bad argument for qMake()", arg1, name);
    }
    return Class::TranslateMemberCall(env, member, args);
}
Ptree* QuoteClass::ProcessBackQuote(Environment* env,
				    char* str, Ptree* arg, Ptree* exp)
{
    ProgramString result;
    result << "(PtreeMaker()";
    while(*str != '\0')
	if(*str == '`'){
	    result << "<<";
	    while(*++str != '`')
		if(*str != '\0')
		    result << *str;
		else{
		    ErrorMessage(env,
				 "unmatched backquote for PtreeUtil::qMake(): ",
				 arg, exp);
		    break;
		}
	    ++str;
	}
	else{
	    result << "<<\"";
	    while(*str != '`' && *str != '\0')
		result << *str++;
	    result << '"';
	}
    result << " << PtreeMaker::End())";
    char* rstr = (char*)result.Read(0);
    return new DupLeaf(rstr, strlen(rstr));
}
bool QuoteClass::Initialize()
{
    return true;
}
char* QuoteClass::MetaclassName()
{
    return "QuoteClass";
}
}
 |