Leksik va sintaksis tahlil

case ':':

i++;

spM[sp]=':';

sp++;

//output(COLON);

break;

522. 
     case ';':
     
523. 
     i++;
     
524. 
     spM[sp]=';';
     
525. 
     sp++;
     
526. 
     //output(SCOLON);
     
527. 
     break;
     

528. 
     case '?':
     
529. 
     i++;
     
530. 
     spM[sp]='+';
     
531. 
     sp++;
     
532. 
     //output(TERNARY);
     
533. 
     break;
     
534. 
     case '\"':
     
535. 
     i++;
     
536. 
     spM[sp]=ch;
     
537. 
     sp++;
     
538. 
     //output(DQ);
     
539. 
     break;
     

540. 
     case '\'':
     
541. 
     i++;
     
542. 
     spM[sp]=ch;
     
543. 
     sp++;
     
544. 
     //output(SQ);
     
545. 
     break;
     
546. 
     case ',':
     
547. 
     i++;
     
548. 
     spM[sp]=ch;
     
549. 
     sp++;
     
550. 
     //output(COMMA);
     
551. 
     break;
     
552. 
     case '|':
     
553. 
     i++;
     
554. 
     spM[sp]=ch;
     
555. 
     sp++;
     
556. 
     //output(PLINE);
     
557. 
     break;
     
558. 
     case '^':
     
559. 
     i++;
     
560. 
     spM[sp]=ch;
     
561. 
     sp++;
     
562. 
     //output(CARAT);
     
563. 
     break;
     
564. 
     case '[':
     
565. 
     i++;
     
566. 
     spM[sp]=ch;
     
567. 
     sp++;
     
568. 
     output(OSB);
     
569. 
     break;
     
570. 
     case ']':
     
571. 
     i++;
     
572. 
     spM[sp]=ch;
     
573. 
     sp++;
     
574. 
     output(CSB);
     
575. 
     break;
     
576. 
     case '#':
     
577. 
     i++;
     
578. 
     spM[sp]=ch;
     
579. 
     sp++;
     
580. 
     output(HSH);
     
581. 
     break;
     
582. 
     case '%':
     
583. 
     i++;
     
584. 
     spM[sp]=ch;
     
585. 
     sp++;
     
586. 
     output(PER);
     
587. 
     break;
     
588. 
     /* case '!':
     
589. 
     i++;
     
590. 
     sp++;
     
591. 
     output(NOTEQU);
     
592. 
     break; */
     
593. 
     case '&':
     
594. 
     i++;
     
595. 
     spM[sp]=ch;
     
596. 
     sp++;
     
597. 
     output(AND);
     
598. 
     break;
     
599. 
     case '\\':
     
600. 
     i++;
     
601. 
     spM[sp]=ch;
     
602. 
     sp++;
     
603. 
     output(BSH);
     
604. 
     break;
     
605. 
     case '.':
     
606. 
     i++;
     
607. 
     spM[sp]=ch;
     
608. 
     sp++;
     
609. 
     output(DOT);
     
610. 
     break;
     
611. 
     default:
     
612. 
     if (isalpha(store[i]))
     
613. 
     {
     
614. 
     j = 0;
     
615. 
     while(isalpha(store[i]))
     
616. 
     lexeme[j++] = store[i++];
     
617. 
     lexeme[j] = '\0';
     
618. 
     output(search(lexeme));
     

619. 
     break;
     
620. 
     }
     
621. 
     else if(isdigit(store[i]))
     
622. 
     {
     
623. 
     j = 0;
     
624. 
     while (isdigit(store[i]))
     
625. 
     lexeme[j++] = store[i++];
     
626. 
     lexeme[j] = '\0';
     
627. 
     digitM[digit]=store[i];
     
628. 
     digit++;
     
629. 
     output(DIGIT);
     
630. 
     break;
     
631. 
     }
     
632. 
     else if (store[i]=='\n')
     
633. 
     {
     
634. 
     i++;
     
635. 
     printf("\n Line=%d\n",line++);
     
636. 
     printf(" ____\n");
     
637. 
     }
     
638. 
     else if (store[i]=='\t' || store[i]==' ')
     
639. 
     i++;
     
640. 
     else
     
641. 
     i++, printf("\tInvalid symbol\n");
     
642. 
     }
     

643. 
     }
     
644. 
     }
     
645. 
     private: System::Void button1_Click(System::Object^ sender, System::EventArgs^ e) {
     
646. 
     FILE *fp1; /* Source file pointer */
     

647. 
     int ch,i; /* used to store character read */
     
648. 
     char store[4000];
     
649. 
     int store_len;
     
650. 
     char file[15];
     
651. 
     /* clrscr(); */
     

652. 
     printf("Enter file name with .c as the extension\n");
     
653. 
     scanf("%s",file);
     
654. 
     //strcat(file, textBox1->Text->);
     

655. 
     for(int i=0; iText->Length; i++)// i ni textBox1 ni uzunligigacha 1 tadan oshirish
     
656. 
     { file[i]=textBox1->Text[i]; }
     

657. 
     fp1 = fopen(file, "r");
     

658. 
     if (fp1 == NULL)
     
659. 
     {
     
660. 
     //printf("The source file can not be opened for reading\n");
     
661. 
     MessageBox::Show("Fayl topilmadi");
     
662. 
     /*exit(1); */
     
663. 
     }
     

664. 
     else {
     
665. 
     /* read till end of file is encountered */
     
666. 
     i = 0;
     
667. 
     while ( (ch = getc(fp1)) != EOF)
     
668. 
     {
     
669. 
     store[i++] = ch;
     
670. 
     }
     

671. 
     store_len = i;
     

672. 
     /* close the input file */
     
673. 
     fclose(fp1);
     
674. 
     //printf("NUMBER\tSYMBOL\t\n");
     
675. 
     //printf("______\t______\t\t\n\n");
     
676. 
     //printf(" Line=1\n");
     
677. 
     //printf(" ____\n");
     
678. 
     lexical(store, store_len);
     
679. 
     label1->Text = "Identifikatorlar= "+ident.ToString();
     
680. 
     dataGridView1->RowCount=ident;
     
681. 
     for (int i = 0; i < ident; i++)
     
682. 
     {
     
683. 
     String ^s = gcnew String(identM[i]);
     
684. 
     //dataGridView1->Rows->Add();
     
685. 
     dataGridView1->Rows[i]->Cells[0]->Value =s;
     
686. 
     }
     
687. 
     //printf("identifiers=%d",ident);
     

688. 
     if( dataGridView1->RowCountRowCount=sp;}
     

689. 
     label2->Text = "Maxsus protsessorlar= "+sp.ToString();
     
690. 
     for (int i = 0; i < sp; i++)
     
691. 
     {
     
692. 
     String ^s = Convert::ToString(spM[i]);
     
693. 
     //dataGridView1->Rows->Add();
     
694. 
     dataGridView1->Rows[i]->Cells[1]->Value =s;
     
695. 
     }
     

696. 
     //printf("\n\n special operators=%d",sp);
     
697. 
     label3->Text = "Aktivr so'zlar= "+key.ToString();
     

698. 
     if( dataGridView1->RowCountRowCount=key;}
     

699. 
     for (int i = 0; i < key; i++)
     
700. 
     {
     
701. 
     String ^s = gcnew String(keyM[i]);
     
702. 
     //dataGridView1->Rows->Add();
     
703. 
     dataGridView1->Rows[i]->Cells[2]->Value =s;
     
704. 
     }
     

705. 
     //printf("\n\nkeywords=%d",key);
     

706. 
     if( dataGridView1->RowCountRowCount=op;}
     

707. 
     for (int i = 0; i < op; i++)
     
708. 
     {
     
709. 
     String ^s = gcnew String(opM[i]);
     
710. 
     //dataGridView1->Rows->Add();
     
711. 
     dataGridView1->Rows[i]->Cells[3]->Value =s;
     
712. 
     }
     
713. 
     label4->Text = "Operator bo'lmaganlar= "+op.ToString();
     
714. 
     //printf("\n\noperators=%d",op);
     

715. 
     if( dataGridView1->RowCountRowCount=digit;}
     

716. 
     for (int i = 0; i < op; i++)
     
717. 
     {
     
718. 
     String ^s = Convert::ToString(digitM[i]);
     
719. 
     //dataGridView1->Rows->Add();
     
720. 
     dataGridView1->Rows[i]->Cells[4]->Value =s;
     
721. 
     }
     
722. 
     label5->Text = "Raqamlar= "+digit.ToString();
     
723. 
     //printf("\n\ndigit=%d\n",digit);
     
724. 
     }
     
725. 
     //getch();
     
726. 
     }
     
727. 
     private: System::Void textBox1_TextChanged(System::Object^ sender, System::EventArgs^ e) {
     

728. 
     }
     
729. 
     private: System::Void textBox1_Click(System::Object^ sender, System::EventArgs^ e) {
     
730. 
     textBox1->Clear();
     
731. 
     }
     
732. 
     };
     
733. 
     }
     

NAZAROT SAVOLLARI

1. 
   Dasturlash tilining sintaktik konstruksiyalarini tasvirlash uchun eng qulay formal usul qaysi usul?
   
2. 
   Dasturning sintaktik to‘g‘riligini aniqlashning yana bir muhim qismi - dasturda tiplardan foydalanishning to‘g‘riligini qaysi grammatika yordamida aniqlab bo‘lmaydi?
   
3. 
   Sintaktik tahlil deganda nima tushuniladi?
   
4. 
   n uzunlikdagi kiruvchi satr uchun murakkabligi qanchadan oshmasligi kerak bo‘lgan har qanday kontekst-erkin grammatika uchun analizator (parser) qurish mumkin?
   
5. 
   Sintaktik tahlillovchi kirish parametrlari nimadan iborat?
   
6. 
   Sintaktik tahlillovchi chiqish parametrlari nimalardan iborat?
   
7. 
   Leksik va sintaktik tahlil bosqichlarining alohida qarashlarga ajratilishi shartmi?
   
8. 
   Sintaktik tahlillovchi sinflari nechta va qaysi sinf algoritmlariga ta’luqli?
   
9. 
   Past sathlarga yo‘naltirilgan analizatorlar chiqishni qurish uchun grammatika nimadan boshlab va nima bilan tugaydi.
   
10. 
    LL grammatika bo‘lmagan grammatikalarda analizatorlar uchun qaysi usullardan foydlanish mumkin.
    
11. 
    Past sathlarga yo‘naltirilgan analizatorlarga qaraganda yuqori sathlarga yo‘naltirilgan analizatorlar qanchalik ishlatiladi.
    
12. 
    YUqori sathlarga yo‘naltirilgan analizatorlar bilan qaysi grammatika bilan bog‘liq.
    
13. 
    Bugungi kunda qaysi grammatikaga asoslangan analizatorlar bilan juda ko‘p dasturlash tillari foydalanmoqda.
    
14. 
    Eng oddiy va juda ko‘p foydalanilgan past sathlarga yo‘naltirilgan analizatorlarni qurish usulini ayting?
    
15. 
    Ifodalarni hisoblashda barcha hisoblashlarni qanday sinflarga ajratish mumkin.
    
16. 
    CHap operandani tanlashimiz va kerakli amalni bajarish uchun son yoki oddiy ifodadan iborat o‘ng operandani aniqlashimiz lozim, so‘ng esa nimani bajarish mumkin.
    
17. 
    Qo‘shish tipiga oid amallarni hisoblash uchun ifodani hisoblashning umumiy formulasi qanday?
    
18. 
    Qiymat qaytarmaslik asosidagi rekursiv kamayish usulidan faqat qaysi shart bajarilganda foydalanish mumkin.
    
19. 
    KS grammatika uchun terminal va terminal bo‘lmagan belgilardan iborat G grammatika va w zanjir asosida FIRST k (w) to‘plamni qanday aniqlaymiz?
    
20. 
    FIRST k (w) to‘plam w dan olingan terminal zanjirlarning uzunligi k bo‘lgan barcha terminal nimalaridan iborat.
    
21. 
    Agar w zanjir faqat terminallardan iborat bo‘lsa, FIRST k (w) - w zanjirda birinchi k belgilardir, aks holda |w| >=, yoki agar |w| < k < bo‘lsa, nima bo‘ladi.
    
22. 
    Agar x teminal emas va grammatika qoidasi x → y1 y2 … yk bo‘lsa, FIRST(X)ga qanday terminalni qo‘shamiz.
    
23. 
    Agar FIRST k (x) = FIRSTk (y) teng, .... o‘rinli bo‘lsa G = (VT, VN, P, S) grammatika LL(k)-grammatika deb aytiladi.
    
24. 
    LL (k) – xususityalari grammatika uchun qanday cheklovlar yuklaydi.
    
25. 
    Agar grammatikada A =>* Aw chiqish mavjud bo‘lsa, A terminal bo‘lmagan KS grammatika nima deb aytiladi.
    
26. 
    Qiymat qaytarish asosidagi rekursiv kamayish usulini qo‘llash uchun grammatikani FIRST to‘plamlar qanday shaklga aylantirish kerak.
    
27. 
    Leksik analizator an’anaviy usullarni to‘laligicha, scan va next ana’naviy usullar va nusxalash konstruktoriga ega bo‘lgan nima sifatida namoyon bo‘ladi?
    
28. 
    Mashina tilidagi matn nimalardan iborat?
    
29. 
    Har bir terminal bo‘lmagan tilning ma’lum bir jumlasiga mos keladigan qaysi shakl yordamida tasvirlash qulay?
    
30. 
    Qaysi ko‘rinishida expr ::= expr1|expr2|expr3 funksiyani yozamiz?
    
31. 
    Forward iteratorlar nima uun kerak?
    
32. 
    Input iteratorlar nima uchun kerak?
    
33. 
    Input iteratorlardan foydalanishni tushuntirib bering?
    
34. 
    Forward iteratorlardan foydalanishni tushuntirib bering?
    
35. 
    Forward iteratorlarning input iteratrlardan farqi nimada?